Average case complete problems
SIAM Journal on Computing
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets
SIAM Journal on Computing
On reductions of NP sets to sparse sets
Journal of Computer and System Sciences
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Efficiency of Resolution and Davis--Putnam Procedures
SIAM Journal on Computing
An Eassay about Research on Sparse NP Complete Sets
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth 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)
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Resolution lower bounds for the weak pigeonhole principle
Journal of the ACM (JACM)
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Holographic Proofs and Derandomization
SIAM Journal on Computing
Linear Upper Bounds for Random Walk on Small Density Random $3$-CNFs
SIAM Journal on Computing
Hardness Amplification for Errorless Heuristics
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Undirected connectivity in log-space
Journal of the ACM (JACM)
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
EXE: Automatically Generating Inputs of Death
ACM Transactions on Information and System Security (TISSEC)
Backdoors to Combinatorial Optimization: Feasibility and Optimality
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Backdoors in the Context of Learning
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Note: Generalized juntas and NP-hard sets
Theoretical Computer Science
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Junta distributions and the average-case complexity of manipulating elections
Journal of Artificial Intelligence Research
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Typically-correct derandomization
ACM SIGACT News
The complexity of manipulative attacks in nearly single-peaked electorates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Relativized Separations of Worst-Case and Average-Case Complexities for NP
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds
Computational Complexity - 13th International Workshop on Randomization and Computation Random 09
The Multivariate Algorithmic Revolution and Beyond
Control in the presence of manipulators: cooperative and competitive cases
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The complexity of manipulative attacks in nearly single-peaked electorates
Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Heuristic approaches often do so well that they seem to pretty much always give the right answer. How close can heuristic algorithms get to always giving the right answer, without inducing seismic complexity-theoretic consequences? This article first discusses how a series of results by Berman, Buhrman, Hartmanis, Homer, Longpré, Ogiwara, Schöning, and Watanabe, from the early 1970s through the early 1990s, explicitly or implicitly limited how well heuristic algorithms can do on NP-hard problems. In particular, many desirable levels of heuristic success cannot be obtained unless severe, highly unlikely complexity class collapses occur. Second, we survey work initiated by Goldreich and Wigderson, who showed how under plausible assumptions deterministic heuristics for randomized computation can achieve a very high frequency of correctness. Finally, we consider formal ways in which theory can help explain the effectiveness of heuristics that solve NP-hard problems in practice.