About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 30. Chapters: Nested word, Average-case complexity, Descriptive complexity theory, Yao's principle, Logic in computer science, Symposium on Foundations of Computer Science, International Colloquium on Automata, Languages and Programming, Alan Turing Year, Indexed language, European Association for Theoretical Computer Science, L-reduction, Horn-satisfiability, Existential theory of the reals, Boolean circuit, Deterministic context-free language, Log-space reduction, RL, Advice, Promise problem, Smoothed analysis, PTAS reduction, Coinduction, Alphabet, Well-structured transition system, Church-Turing-Deutsch principle, Bigraph, Generalized star height problem, Semi-membership, Adiabatic quantum computation, CAP theorem, Search problem, Fagin's theorem, Parikh's theorem, Locally testable code, Symposium on Theoretical Aspects of Computer Science, Star-free language, Hardness of approximation, Knuth Prize, NSPACE, Padding argument, Stuttering equivalence, Quantum complexity theory, Well Equidistributed Long-period Linear, Normal form, International Workshop on First-Order Theorem Proving, Query, PolyL, Structural complexity theory, FL, Probabilistic analysis of algorithms, Ingo Wegener, Expander mixing lemma, Rectilinear minimum spanning tree, Quantum sort, Low and high hierarchies, Reed-Muller expansion, Deterministic automaton, Toda's theorem, Finite thickness, Counting problem, Levenshtein automaton, Transaction logic, NTIME, Electronic Proceedings in Theoretical Computer Science, Sharp-SAT, PLS, Electronic Notes in Theoretical Computer Science, ZPL, Certificate, Supercombinator, Random-access Turing machine, LH, GapP, Constrained Delaunay triangulation, DLOGTIME, Weighted context-free grammar, Postselection, Quantum threshold theorem, Linear tree, L/poly, NONELEMENTARY, ESPACE. Excerpt: In computer science, more specifically in ...
