Stanford CS 254
Computational Complexity
Course Description
Raw: An introduction to computational complexity theory. Topics include the P versus NP problem; d
Stemmed: introduct comput complex theori topic includ versu problem diagon space complex pspace savitch theor
Inferred Topics
-
23
(0.476166) comput, automata, languag, complex, machin, theori, ture, regular, finit, complet
(0.934) KSU CIS 770 Formal Language Theory
(0.826) RPI CSCI 4050 Computability and Complexity
(0.794) PDX CS 583 Automata & Formal Languages
(0.723) RPI CSCI 6050 Computability and Complexity
(0.708) PDX CS 311 Computational Structures
(0.686) UTK COSC 482 Theory of Computation
(0.670) PDX CS 582 Theory of Computation: Advanced Topics
(0.645) SC CSCE 551 Theory of Computation
(0.618) LSU CSC 4890 Introduction to Theory of Computation
(0.609) UTK COSC 312 Algorithm Analysis and Automata
(0.584) SC CSCE 355 Foundations of Computation
(0.580) GMU CS 600 Theory of Computation
(0.574) KSU CIS 570 Introduction to Formal Language Theory
(0.543) PDX CS 581 Theory of Computation
(0.510) Utah CS 5100 Foundations of Computer Science
(0.476) Stanford CS 254 Computational Complexity
(0.461) RPI CSCI 2200 Foundations of Computer Science
(0.350) LSU CSC 7150 Program Analysis and Model Checking
(0.287) Stanford CS 103 Mathematical Foundations of Computing
(0.201) ACM EC 0 Introduction to Compilers
(0.199) Utah CS 3100 Models of Computation
(0.166) ACM EC 0 Mathematical Foundations of Computer Science
(0.164) KSU CIS 301 Logical Foundations of Programming
-
5
(0.169975) includ, estim, theorem, probabl, distribut, condit, variabl, count, expect, independ
(0.569) ACM EC 0 Mathematical Foundations of Computer Science
(0.454) Stanford CS 109 Introduction to Probability for Computer Scientists
(0.439) Utah CS 3130 Engineering Probability and Statistics
(0.218) ACM EC 0 Discrete Structures II
(0.170) Stanford CS 254 Computational Complexity
No prerequisites registered.