The quantitative structure of exponential time
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 59 references indexed in Scilit:
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, 1992
- Completeness for nondeterministic complexity classesTheory of Computing Systems, 1991
- On inefficient special cases of NP-complete problemsTheoretical Computer Science, 1989
- OnP-subset structuresTheory of Computing Systems, 1987
- Complete sets and closeness to complexity classesTheory of Computing Systems, 1986
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Relativized circuit complexityJournal of Computer and System Sciences, 1985
- Families of recursive predicates of measure zeroJournal of Mathematical Sciences, 1976
- A unified approach to the definition of random sequencesTheory of Computing Systems, 1971
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947