Computing functions with parallel queries to NP
Authors:
- 17 April 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 141 (1-2) , 175-193
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A taxonomy of complexity classes of functionsJournal of Computer and System Sciences, 1994
- On polynomial-time truth-table reducibility of intractable sets to P-selective setsTheory of Computing Systems, 1991
- Classes of bounded nondeterminismTheory of Computing Systems, 1990
- NP is as easy as detecting unique solutionsTheoretical Computer Science, 1986
- On the unique satisfiability problemInformation and Control, 1982
- A note on the graph isomorphism counting problemInformation Processing Letters, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- The circuit value problem is log space complete for PACM SIGACT News, 1975