scientific article
From MaRDI portal
Publication:3751004
zbMath0611.68018MaRDI QIDQ3751004
Hemaspaandra, Lane A., Jinyi Chai
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A Survey on Difference Hierarchies of Regular Languages, Polynomial terse sets, More complicated questions about maxima and minima, and some closures of NP, Complexity classes without machines: on complete languages for UP, With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy, The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\), Characterizations of some complexity classes between Θ2p and Δ2p, The difference and truth-table hierarchies for NP, New developments in structural complexity theory, The Boolean hierarchy of NP-partitions, On truth-table reducibility to SAT, Why not negation by fixpoint?, Bounded queries to SAT and the Boolean hierarchy, Fine hierarchies and m-reducibilities in theoretical computer science, On boolean lowness and boolean highness, Dot operators, Nondeterministic and randomized Boolean hierarchies in communication complexity, Complexity classes between $\Theta _k^P$ and $\Delta _k^P$, Covered clauses are not propagation redundant, A note on parallel queries and the symmetric-difference hierarchy.
