New developments in structural complexity theory
Open Access
- 1 March 1990
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 71 (1) , 79-93
- https://doi.org/10.1016/0304-3975(90)90191-j
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Collapsing oracle hierarchies, census functions and logarithmically many queriesPublished by Springer Nature ,2006
- Relativized circuit complexityJournal of Computer and System Sciences, 1985
- Computation times of NP sets of different densitiesTheoretical Computer Science, 1984
- Turing MachinesScientific American, 1984
- Space-bounded hierarchies and probabilistic computationsJournal of Computer and System Sciences, 1984
- Some consequences of non-uniform conditions on uniform classesTheoretical Computer Science, 1983
- A note on sparse oracles for NPJournal of Computer and System Sciences, 1982
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976