The complexity and distribution of hard problems
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 177-185
- https://doi.org/10.1109/sfcs.1993.366869
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Measure, Stochasticity, and the Density of Hard LanguagesSIAM Journal on Computing, 1994
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, 1992
- On inefficient special cases of NP-complete problemsTheoretical Computer Science, 1989
- On solving hard problems by polynomial-size circuitsInformation Processing Letters, 1987
- The density and complexity of polynomial cores for intractable setsInformation and Control, 1986
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Hard-core theorems for complexity classesJournal of the ACM, 1985
- Provably Difficult Combinatorial GamesSIAM Journal on Computing, 1979
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- On the Computational Complexity of AlgorithmsTransactions of the American Mathematical Society, 1965