Notions of resource-bounded category and genericity
- 10 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Oracles for structural properties: the isomorphism problem and public-key cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Almost everywhere high nonuniform complexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Category and Measure in Complexity ClassesSIAM Journal on Computing, 1990
- Complexity Measures for Public-Key CryptosystemsSIAM Journal on Computing, 1988
- Diagonalizations over polynomial time computable setsTheoretical Computer Science, 1987
- Recursively Enumerable Sets and DegreesPublished by Springer Nature ,1987
- P-generic setsPublished by Springer Nature ,1984
- Notions of weak genericityThe Journal of Symbolic Logic, 1983
- Degrees of Generic SetsPublished by Cambridge University Press (CUP) ,1980
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975