Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Constructive bounds and exact expectation for the random assignment problem
Random Structures & Algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The ζ (2) limit in the random assignment problem
Random Structures & Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Cellular frustration: a new conceptual framework for understanding cell-mediated immune responses
ICARIS'06 Proceedings of the 5th international conference on Artificial Immune Systems
Toward understanding the optimization of complex systems
Artificial Intelligence Review
| Hi-index | 0.00 |
The branch of theoretical computer science known as computational complexity is concerned with classifying problems according to the computational resources required to solve them. This theory has some interesting links to physics, in particular to quantum computing and statistical mechanics. This article contains an informal introduction to this theory and its links to physics.