Resource-bounded genericity
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degreesPublished by Springer Nature ,2006
- P-genericity and strong p-genericityPublished by Springer Nature ,2005
- The quantitative structure of exponential timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Notions of resource-bounded category and genericityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Structural Complexity IPublished by Springer Nature ,1995
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, 1992
- Recursively Enumerable Sets and DegreesPublished by Springer Nature ,1987
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Measure and CategoryPublished by Springer Nature ,1980
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975