About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 94. Chapters: Quantum computer, Analysis of algorithms, Best, worst and average case, Communication complexity, Polynomial-time reduction, Interactive proof system, Complexity class, Time complexity, Aanderaa-Karp-Rosenberg conjecture, List-decoding, Universal hashing, Generic-case complexity, Randomness extractor, Information-based complexity, Pseudorandom generator theorem, Cook-Levin theorem, Klee-Minty cube, Computing the permanent, Unique games conjecture, Computational complexity of mathematical operations, Circuits over sets of natural numbers, Decision tree model, Approximation algorithm, Cobham's thesis, Turing reduction, Kernelization, Complexity index, Parameterized complexity, Circuit complexity, Context of computational complexity, Proof complexity, Karp-Lipton theorem, Computational topology, Propositional proof system, Combinatorial optimization, Nondeterministic algorithm, PCP theorem, Natural proof, Many-one reduction, Descriptive complexity theory, L-notation, Low, Savitch's theorem, Yao's principle, SO, Averaging argument, The Complexity of Songs, Strongly NP-complete, Interval-valued computation, Integer circuit, Configuration graph, Sparse language, Constructible function, Pseudo-polynomial time, Symmetric Turing machine, Pebble game, Schaefer's dichotomy theorem, Complement, L-reduction, Existential theory of the reals, Computational resource, Unary language, Electronic Colloquium on Computational Complexity, Boolean circuit, Log-space reduction, Advice, Smoothed analysis, Gap theorem, Switching lemma, Truth-table reduction, PTAS reduction, Dynamic problem, Asymptotic computational complexity, Semi-membership, Linear speedup theorem, Weakly NP-complete, Hardness of approximation, Blum's speedup theorem, Leaf language, Padding argument, Quantum complexity theory, Generalized game, Computation tree, Transdicho...
