Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

@article{Glaer2017CircuitSA,
  title={Circuit satisfiability and constraint satisfaction around Skolem Arithmetic},
  author={Christian Gla\sser and Peter Jonsson and Barnaby Martin},
  journal={Theor. Comput. Sci.},
  year={2017},
  volume={703},
  pages={18-36}
}
Article history: Received 9 July 2016 Received in revised form 31 July 2017 Accepted 31 August 2017 Available online xxxx Communicated by V.Th. Paschos 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 54 references

The Computational Complexity of Logical Theories

  • J. Ferrante, C. W. Rackoff
  • Lecture Notes in Mathematics, vol. 718, Springer…
  • 1979
Highly Influential
20 Excerpts

T

  • M. Bodirsky, P. Jonsson
  • von Oertzen, Essential convexity and complexity…
  • 2017
1 Excerpt

Similar Papers

Loading similar papers…