Satisfiability of algebraic circuits over sets of natural numbers

@article{Glaer2010SatisfiabilityOA,
  title={Satisfiability of algebraic circuits over sets of natural numbers},
  author={Christian Gla{\ss}er and Christian Reitwie{\ss}ner and Stephen D. Travers and Matthias Waldherr},
  journal={Discret. Appl. Math.},
  year={2010},
  volume={158},
  pages={1394-1403}
}
We investigate the complexity of satisfiability problems for {@?,@?,^-,+,x}-circuits computing sets of natural numbers. These problems are a natural generalization of membership problems for expressions and circuits studied by Stockmeyer and Meyer (1973) [10] and McKenzie and Wagner (2003) [8]. Our work shows that satisfiability problems capture a wide range of complexity classes such as NL, P, NP, PSPACE, and beyond. We show that in several cases, satisfiability problems are harder than… Expand
Balance Problems for Integer Circuits
  • Titus Dose
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2018
TLDR
The work shows that the balance problem for {−, ·}-circuits is undecidable which is the first natural problem for integer circuits or related constraint satisfaction problems that admits only one arithmetic operation and is proven to be Undecidable. Expand
Balance problems for integer circuits
  • Titus Dose
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2019
TLDR
The work shows that the balance problem for { ∖, ⋅ } -circuits is undecidable which is the first natural problem for integer circuits or related constraint satisfaction problems that admits only one arithmetic operation and is proven to be Undecidable. Expand
Emptiness problems for integer circuits
TLDR
It turns out that the following problems are equivalent to PIT, which shows that the challenge to improve their bounds is just a reformulation of a well-studied, major open problem in algebraic computing complexity. Expand
Emptiness Problems for Integer Circuits
TLDR
It turns out that the following problems are equivalent to PIT, which shows that the challenge to improve their bounds is just a reformulation of a major open problem in algebraic computing complexity. Expand
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic
We study interactions between Skolem Arithmetic and certain classes of Circuit Satisfiability and Constraint Satisfaction Problems (CSPs). We revisit results of Glaser et al. [16] in the context ofExpand
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Abstract We study interactions between Skolem Arithmetic and certain classes of Circuit Satisfiability and Constraint Satisfaction Problems (CSPs). We revisit results of Glaser et al. [1] in theExpand
Functions Definable by Arithmetic Circuits
TLDR
Two negative results are proved: the first shows, roughly, that a function is not circuit-definable if it has an infinite range and sub-linear growth; the second shows,roughly, that it has a finite range and fails to converge on certain `sparse' chains under inclusion. Expand
Functions definable by numerical set-expressions
TLDR
This article investigates the definability of sets and functions by means of additive and arithmetic circuits, occasionally augmented with additional operations. Expand
Parsing Unary Boolean Grammars Using Online Convolution
TLDR
A new algorithm solving the membership problem for context-free grammars generating strings over a one-letter alphabet is developed, which is based upon fast multiplication of integers, works in time jGj n log 3 n 2 O(log n) , and is applicable to the more general conjunctive and Boolean Grammars. Expand
Parsing Boolean grammars over a one-letter alphabet using online convolution
TLDR
A new algorithm solving the membership problem for context-free grammars generating strings over a one-letter alphabet is developed, which is based upon fast multiplication of integers, works in time |G|@?nlog^3n@?2^O^(^l^o^g^^^*^n^), and is applicable to context- free Grammars augmented with Boolean operations, known as Boolean grammARS. Expand

References

SHOWING 1-10 OF 13 REFERENCES
Equivalence Problems for Circuits over Sets of Natural Numbers
TLDR
This work gives a systematic characterization of the complexity of equivalence problems over sets of natural numbers and provides an improved upper bound for the case of {∪, ∩,-,+, ×}-circuits. Expand
Integer circuit evaluation is PSPACE-complete
  • Ke Yang
  • Mathematics, Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
TLDR
A polynomial-time algorithm is shown that reduces QBP (quantified Boolean formula) problem to the integer circuit problem, which complements the result of K. Wagner (1984) to show that IC problem is PSPACEcomplete. Expand
The complexity of theorem-proving procedures
  • S. Cook
  • Computer Science, Mathematics
  • STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is aExpand
Word problems requiring exponential time(Preliminary Report)
TLDR
A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered. Expand
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledgeExpand
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
TLDR
The problem of testing membership in the subset of the natural numbers produced at the output gate of a combinational circuit is shown to capture a wide range of complexity classes, and results extend in nontrivial ways past work by Stockmeyer and Meyer, Wagner, Wagner and Yang. Expand
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
  • 50 Years of Integer Programming
  • 2010
TLDR
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability. Expand
PRIMES is in P
We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid. Expand
ENUMERABLE SETS ARE DIOPHANTINE
...
1
2
...