Tractability conditions for numeric CSPs (Q683751): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Polynomial algorithms for linear programming over the algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-dichotomies in Constraint Satisfaction Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essential Convexity and Complexity of Semi-Algebraic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of temporal constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of surjective homomorphism problems-a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Closed Semilinear Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems over Numeric Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for the First Order Theory of Real Addition with Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of linear constraints over the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine Consistency and the Complexity of Semilinear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction and semilinear expansions of addition over the rationals and the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4513933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Some Geometric and Topological Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points, Nash equilibria, and the existential theory of the reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4392286 / rank
 
Normal rank

Revision as of 02:16, 15 July 2024

scientific article
Language Label Description Also known as
English
Tractability conditions for numeric CSPs
scientific article

    Statements

    Tractability conditions for numeric CSPs (English)
    0 references
    0 references
    0 references
    9 February 2018
    0 references
    constraint satisfaction problem
    0 references
    semialgebraic constraint
    0 references
    o-minimality
    0 references
    algebraic variety
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references