scientific article; zbMATH DE number 3988706
From MaRDI portal
Publication:3751004
zbMATH Open0611.68018MaRDI QIDQ3751004FDOQ3751004
Lane A. Hemaspaandra, Jinyi Chai
Publication date: 1986
Title of this publication is not available (Why is that?)
Cited In (22)
- The difference and truth-table hierarchies for NP
- Polynomial terse sets
- The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\)
- Why not negation by fixpoint?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dot operators
- On truth-table reducibility to SAT
- A Survey on Difference Hierarchies of Regular Languages
- The Boolean hierarchy of NP-partitions
- New developments in structural complexity theory
- Fine hierarchies and m-reducibilities in theoretical computer science
- Complexity classes without machines: on complete languages for UP
- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
- More complicated questions about maxima and minima, and some closures of NP
- Nondeterministic and randomized Boolean hierarchies in communication complexity
- Bounded queries to SAT and the Boolean hierarchy
- Covered clauses are not propagation redundant
- A note on parallel queries and the symmetric-difference hierarchy.
- On boolean lowness and boolean highness
- Characterizations of some complexity classes between Ξ2p and Ξ2p
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
Recommendations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751004)
