Some connections between bounded query classes and nonuniform complexity
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Two remarks on the power of countingPublished by Springer Nature ,2005
- On the boolean closure of NPPublished by Springer Nature ,2005
- Terse, Superterse, and Verbose SetsInformation and Computation, 1993
- Bounded query computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-MachinesSIAM Journal on Computing, 1987
- More complicated questions about maxima and minima, and some closures of NPPublished by Springer Nature ,1986
- Relativized circuit complexityJournal of Computer and System Sciences, 1985
- Some consequences of non-uniform conditions on uniform classesTheoretical Computer Science, 1983
- Strong nondeterministic polynomial-time reducibilitiesTheoretical Computer Science, 1982
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexityInformation and Control, 1982