Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

@article{Glaer2017CircuitSA,
  title={Circuit satisfiability and constraint satisfaction around Skolem Arithmetic},
  author={Christian Gla{\ss}er and Peter Jonsson and Barnaby Martin},
  journal={Theor. Comput. Sci.},
  year={2017},
  volume={703},
  pages={18-36}
}
View via Publisher
ida.liu.se
2 Citations
Methods Citations
1

Tables from this paper

2 Citations

A Study: Various NP-Hard Problems in VLSI and the Need for Biologically Inspired Heuristics
TLDR
Various NP-hard problems which are in association with VLSI design akin wirelength minimization, area minimization), dead space minimization and so forth are delineated and the significant role of biologically inspired algorithms is discussed in a concise manner.
Discrete Mutation Hopfield Neural Network in Propositional Satisfiability
TLDR
This study provides a new paradigm in the field of neural networks by overcoming the overfitting issue and presents an integrated representation of k-satisfiability (kSAT) in a mutation hopfield neural network (MHNN).

References

SHOWING 1-10 OF 72 REFERENCES
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.
Satisfiability of algebraic circuits over sets of natural numbers
A Proof of CSP Dichotomy Conjecture
  • Dmitriy Zhuk
  • Mathematics, Computer Science
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
TLDR
An algorithm is presented that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.
The complexity of satisfiability problems
TLDR
An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
Complexity of subcases of Presburger arithmetic
We consider formula subclasses of Presburger arithmetic which have a simple structure in one sense or the other and investigate their computational complexity. We also prove some results on the lower…
Integer circuit evaluation is PSPACE-complete
  • Ke Yang
  • Mathematics
    Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
TLDR
The integer circuit problem is PSPACE-complete, resolving an open problem posed by P. McKenzie, H. Vollmer, and K. W. Wagner (2000).
A Dichotomy Theorem for Nonuniform CSPs
  • A. Bulatov
  • Mathematics
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
TLDR
The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language \Gm the problem CSP is either solvable in polynomial time or is NP-complete.
Schaefer's Theorem for Graphs
TLDR
It is proved that either Ψ is contained in one out of 17 classes of graph formulas and the corresponding problem can be solved in polynomial time, or the problem is NP-complete.
Non-dichotomies in Constraint Satisfaction Complexity
TLDR
It is shown that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template and that if the so-called local-global conjecture for infinite constraint languages(over a finite domain) is false, then there is no dichotomy for the constraints satisfaction problem for infinite constraints languages.
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
TLDR
It is shown that the membership problem for the general case and for (∪∩,+,×) is PSPACE-complete, whereas it is NEXPTIME-hard if one allows 0, and several other cases are resolved.
...
...