The complexity of membership problems for circuits over sets of integers
From MaRDI portal
Publication:861262
DOI10.1016/j.tcs.2006.08.017zbMath1110.68048OpenAlexW1990151088MaRDI QIDQ861262
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.017
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (22)
Equations over sets of integers with addition only ⋮ The Odds of Staying on Budget ⋮ Path Checking for MTL and TPTL over Data Words ⋮ Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic ⋮ A lower bound for the coverability problem in acyclic pushdown VAS ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ Emptiness problems for integer circuits ⋮ Parallel algorithms for power circuits and the word problem of the Baumslag group ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complexity of equations over sets of natural numbers ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ Percentile queries in multi-dimensional Markov decision processes ⋮ Evaluation of circuits over nilpotent and polycyclic groups ⋮ Functions Definable by Arithmetic Circuits ⋮ Representing hyper-arithmetical sets by equations over sets of integers ⋮ Equivalence problems for circuits over sets of natural numbers ⋮ Least and greatest solutions of equations over sets of integers ⋮ Unnamed Item ⋮ Emptiness Problems for Integer Circuits ⋮ Balance problems for integer circuits ⋮ Reachability in two-clock timed automata is PSPACE-complete
Cites Work
This page was built for publication: The complexity of membership problems for circuits over sets of integers
