Get started
Keyword

complexity classes

Description: Complexity classes are groups of computational problems classified by the computational resources required to solve them.
Wikidata ID: wiki/Q908207
OpenAlex ID: keywords/complexity-classes
Computational Complexity
1995 · Peter Brucker · Springer eBooks · 2,289
Optimization, approximation, and complexity classes
1991 · Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1,652
Computation at the edge of chaos: Phase transitions and emergent computation
1990 · Chris G. Langton · Physica D Nonlinear Phenomena · 1,527
PDF
Quantum Complexity Theory
1997 · Ethan Bernstein, Umesh Vazirani · SIAM Journal on Computing · 1,499
Alternation
1981 · Ashok K. Chandra, Dexter C. Kozen, et al. · Journal of the ACM · 1,221
PDF
On the Computational Complexity of Algorithms
1965 · J. Hartmanis, R. E. Stearns · Transactions of the American Mathematical Society · 1,009
PDF
Parallelism in random access machines
1978 · Steven Fortune, James Wyllie · ACM Symposium on Theory of Computing (STOC) · 901
Probabilistic computations: Toward a unified measure of complexity
1977 · Andrew Chi-Chin Yao · Annual Symposium on Foundations of Computer Science · 876
Structural Complexity I
1988 · José Luis Balcázar, Josep Díaz, et al. · Texts in theoretical computer science · 866
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
1975 · Theodore Baker, John Gill, et al. · SIAM Journal on Computing · 739
Algebraic methods for interactive proof systems
1992 · Carsten Lund, Lance Fortnow, et al. · Journal of the ACM · 711
PDF
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
1986 · D A Barrington · 669
Quantum-inspired genetic algorithms
2002 · A. Narayanan, M. Moore · IEEE International Conference on Evolutionary Computation (ICEC) · 649
A Catalog of Complexity Classes
1990 · David S. JOHNSON · Elsevier eBooks · 579
Computational Complexity: ADVANCED TOPICS
2009 · Sanjeev Arora, Boaz Barak · 576
Languages that Capture Complexity Classes
1987 · Neil Immerman · SIAM Journal on Computing · 546
Non-deterministic exponential time has two-prover interactive protocols
1992 · L. Babai, L. Fortnow, et al. · Computational Complexity · 520
PDF
A complexity theoretic approach to randomness
1983 · Michael Sipser · 467
Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity
1994 · Jan Van Leeuwen · 444
Computational complexity: a conceptual perspective
2008 · Choice Reviews Online · 421
Algorithms and Complexity: New Directions and Recent Results
1976 · J. F. Traub · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · 417
Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979
1980 · 章治郎 室 · 情報処理 · 410
A comparison of polynomial time reducibilities
1975 · R.E. Ladner, N.A. Lynch, et al. · Theoretical Computer Science · 410
Complete sets and the polynomial-time hierarchy
1976 · Celia Wrathall · Theoretical Computer Science · 394
PDF
The Computational Complexity of Algebraic and Numeric Problems.
1975 · Allan Borodin, Ian Munro · CERN Document Server (European Organization for Nuclear Research) · 392
Works count: 4,027
Citation count: 59,220
Year
Topic
Type