Computability and complexity theory.
From MaRDI portal
Publication:640476
DOI10.1007/978-1-4614-0682-2zbMath1248.68192OpenAlexW4298156820MaRDI QIDQ640476
Selman, Alan L., Homer, Steven
Publication date: 18 October 2011
Published in: Texts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0682-2
computational complexitydecidabilityTuring machinecomputabilityrandomnesscounting complexityinteractive proof
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Machines that perform measurements ⋮ The complexity of the \(K\)th largest subset problem and related problems ⋮ Effective guessing has unlikely consequences ⋮ Analyzing fractional Horn constraint systems ⋮ \textsc{Hanano} puzzle is \textsf{NP}-hard ⋮ Further results on an abstract model for branching and its application to mixed integer programming ⋮ A note on the complexity of S4.2 ⋮ A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF ⋮ Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets ⋮ On the termination and structural termination problems for counter machines with incrementing errors ⋮ Schema mapping coverage
This page was built for publication: Computability and complexity theory.
