Locating P/poly optimally in the extended low hierarchy
Author:
- J. KöblerJKJ. Köbler
- 1 November 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 134 (2) , 263-285
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Upper Bounds for the Complexity of Sparse and Tally DescriptionsTheory of Computing Systems, 1996
- Lower bounds for the low hierarchyJournal of the ACM, 1992
- Strong and robustly strong polynomial-time reducibilities to sparse setsTheoretical Computer Science, 1991
- Graph isomorphism is in the low hierarchyJournal of Computer and System Sciences, 1988
- Complete sets and closeness to complexity classesTheory of Computing Systems, 1986
- Computation times of NP sets of different densitiesTheoretical Computer Science, 1984
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976