Subclasses of binary NP
From MaRDI portal
Publication:4399718
DOI10.1093/logcom/8.2.189zbMath0901.68076OpenAlexW1968490853MaRDI QIDQ4399718
Clemens Lautemann, Arnaud Durand, Thomas Schwentick
Publication date: 28 July 1998
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/17a8dce0e5151714040b226381f4b0705998de09
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ Closure properties of locally finite \(\omega\)-languages ⋮ Semantic Restrictions over Second-Order Logic ⋮ Comparing the Power of Games on Graphs ⋮ The closure of monadic NP ⋮ Hybrid logic meets IF modal logic ⋮ Linear time and the power of one first-order universal quantifier ⋮ Existential second-order logic and modal logic with quantified accessibility relations
This page was built for publication: Subclasses of binary NP
