Average case complete problems
SIAM Journal on Computing
On the method of approximations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
SIAM Journal on Computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A personal view of average-case complexity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
IEEE Annals of the History of Computing
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Parameterized Complexity
sgen1: A generator of small but difficult satisfiability benchmarks
Journal of Experimental Algorithmics (JEA)
The quest for a logic for polynomial-time computation: technical perspective
Communications of the ACM
Human-machine learning for intelligent aircraft systems
AIS'11 Proceedings of the Second international conference on Autonomous and intelligent systems
The GCT program toward the P vs. NP problem
Communications of the ACM
On the computational challenges of analogy-based generalization
Cognitive Systems Research
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
An optical solution to the 3-SAT problem using wavelength based selectors
The Journal of Supercomputing
Inductive complexity of p versus NP problem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Communications of the ACM
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Discrete Tomography Data Footprint Reduction via Natural Compression
Fundamenta Informaticae - Strategies for Tomography
| Hi-index | 0.05 |
It's one of the fundamental mathematical problems of our time, and its importance grows with the rise of powerful computers.