Lower bounds for the low hierarchy
- 1 January 1989
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Robust oracle machinesPublished by Springer Nature ,2005
- Constructing Oracles by Lower Bound Techniques for CircuitsPublished by Springer Nature ,1989
- Graph isomorphism is in the low hierarchyJournal of Computer and System Sciences, 1988
- Polynomial terse setsInformation and Computation, 1988
- On helping by robust oracle machinesTheoretical Computer Science, 1987
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983
- The maximum value problem and NP real numbersJournal of Computer and System Sciences, 1982
- Some observations on NP real numbers and P-selective setsJournal of Computer and System Sciences, 1981
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975