Boolean operations, joins, and the extended low hierarchy
Open Access
- 1 September 1998
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 205 (1-2) , 317-327
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Computing Solutions Uniquely Collapses the Polynomial HierarchySIAM Journal on Computing, 1996
- Polynomial-Time Membership Comparable SetsSIAM Journal on Computing, 1995
- P-selectivity: Intersections and indicesTheoretical Computer Science, 1995
- Locating P/poly optimally in the extended low hierarchyTheoretical Computer Science, 1994
- LownessACM SIGACT News, 1993
- Lower bounds for the low hierarchyJournal of the ACM, 1992
- Separating the low and high hierachies by oraclesInformation and Computation, 1991
- Sparse Sets, Lowness and HighnessSIAM Journal on Computing, 1986
- On Circuit-Size Complexity and the Low Hierarchy in NPSIAM Journal on Computing, 1985
- A low and a high hierarchy within NPJournal of Computer and System Sciences, 1983