Computability and complexity theory
From MaRDI portal
Publication:5925717
zbMath1033.68045MaRDI QIDQ5925717
Homer, Steven, Selman, Alan L.
Publication date: 19 February 2001
Published in: Texts in Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Population-based local search for protein folding simulation in the MJ energy model and cubic lattices ⋮ Separating NE from Some Nonuniform Nondeterministic Complexity Classes ⋮ Autoreducibility, mitoticity, and immunity ⋮ The complexity of reasoning with FODD and GFODD ⋮ Proof system representations of degrees of disjoint NP-pairs ⋮ Non-uniform reductions ⋮ A combinatorial algorithm for Horn programs ⋮ Separating NE from some nonuniform nondeterministic complexity classes ⋮ Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy ⋮ Aggregating disparate estimates of chance ⋮ Feasibility checking in Horn constraint systems through a reduction based approach
This page was built for publication: Computability and complexity theory
