On the Amount of Nondeterminism and the Power of Verifying
From MaRDI portal
Publication:4337644
DOI10.1137/S0097539793258295zbMath0870.68062MaRDI QIDQ4337644
Publication date: 26 May 1997
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Simplifying the weft hierarchy ⋮ Fixed-parameter approximation: conceptual framework and approximability results ⋮ Parameterized Complexity and Subexponential-Time Computability ⋮ IN MEMORIAM CHANDRA KINTALA ⋮ Bounded fixed-parameter tractability and reducibility ⋮ Context-dependent nondeterminism for pushdown automata ⋮ Parameterized complexity of three edge contraction problems with degree constraints ⋮ Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ⋮ The intractability of computing the Hamming distance ⋮ A fixed-parameter-tractable algorithm for set packing ⋮ The inapproximability of non-NP-hard optimization problems. ⋮ The minimum equivalent DNF problem and shortest implicants
This page was built for publication: On the Amount of Nondeterminism and the Power of Verifying
