Circuit satisfiability and constraint satisfaction around Skolem arithmetic
From MaRDI portal
(Redirected from Publication:1676359)
Recommendations
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic
- Satisfiability of algebraic circuits over sets of natural numbers
- Satisfiability of Algebraic Circuits over Sets of Natural Numbers
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
- Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.
Cites work
- scientific article; zbMATH DE number 3874609 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1827828 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Classifying the Complexity of Constraints Using Finite Algebras
- Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.
- Complexity of Subcases of Presburger Arithmetic
- Complexity of equations over sets of natural numbers
- Computational completeness of equations over sets of natural numbers
- Computational complexity of linear constraints over the integers
- Constraint Satisfaction Problems of Bounded Width
- Constraint satisfaction problems over the integers with successor
- Cores of Countably Categorical Structures
- Dichotomies for classes of homomorphism problems involving unary functions
- Dominoes and the complexity of subclasses of logical theories
- Equivalence problems for circuits over sets of natural numbers
- Essential convexity and complexity of semi-algebraic constraints
- Functions definable by arithmetic circuits
- Integer circuit evaluation is PSPACE-complete
- Non-dichotomies in Constraint Satisfaction Complexity
- On direct products of theories
- On the algebraic structure of combinatorial problems
- On the complexity of H-coloring
- On the complexity of integer programming
- Satisfiability of algebraic circuits over sets of natural numbers
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The complexity of membership problems for circuits over sets of integers
- The complexity of membership problems for circuits over sets of natural numbers
- The complexity of satisfiability problems
- The complexity of temporal constraint satisfaction problems
- The computational complexity of logical theories
- The decision problem for exponential diophantine equations
Cited in
(6)- Satisfiability of algebraic circuits over sets of natural numbers
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic
- Balance problems for integer circuits
- Balance problems for integer circuits
- Emptiness problems for integer circuits
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
This page was built for publication: Circuit satisfiability and constraint satisfaction around Skolem arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676359)
