Genericity and measure for exponential time
- 10 November 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 168 (1) , 3-19
- https://doi.org/10.1016/0304-3975(96)89424-2
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The Complexity and Distribution of Hard ProblemsSIAM Journal on Computing, 1995
- Measure, Stochasticity, and the Density of Hard LanguagesSIAM Journal on Computing, 1994
- Resource bounded randomness and weakly complete problemsPublished by Springer Nature ,1994
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, 1992
- Category and Measure in Complexity ClassesSIAM Journal on Computing, 1990
- Diagonalizations over polynomial time computable setsTheoretical Computer Science, 1987
- On relativized exponential and probabilistic complexity classesInformation and Control, 1986
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975