The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
From MaRDI portal
Publication:5444954
DOI10.1007/978-3-540-74240-1_12zbMath1135.68435OpenAlexW1857518139MaRDI QIDQ5444954
Publication date: 26 February 2008
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_12
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ Emptiness problems for integer circuits ⋮ Unnamed Item ⋮ Complexity of equations over sets of natural numbers ⋮ Equivalence problems for circuits over sets of natural numbers ⋮ Emptiness Problems for Integer Circuits ⋮ Balance problems for integer circuits
This page was built for publication: The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
