Max-Closed Semilinear Constraint Satisfaction
From MaRDI portal
Publication:5740179
DOI10.1007/978-3-319-34171-2_7zbMath1386.68067OpenAlexW2249426533MaRDI QIDQ5740179
Manuel Bodirsky, Marcello Mamino
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_7
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Constraint Satisfaction Problems over Numeric Domains ⋮ Tractability conditions for numeric CSPs ⋮ The tropical analogue of the Helton-Nie conjecture is true
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- Computational complexity of linear constraints over the integers
- A representation of convex semilinear sets
- A unifying approach to temporal constraint reasoning
- The complexity of mean payoff games on graphs
- Tropically convex constraint satisfaction
- Tropical convexity
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
- TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES
- Tropical Effective Primary and Dual Nullstellens"atze
- Essential Convexity and Complexity of Semi-Algebraic Constraints
- Constraint Satisfaction Problems over the Integers with Successor
- A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
- Mean-Payoff Games and Propositional Proofs
- Semilinear Program Feasibility
- A Decision Procedure for the First Order Theory of Real Addition with Order
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Closure properties of constraints
- Scheduling with AND/OR Precedence Constraints
- Classifying the Complexity of Constraints Using Finite Algebras
- The Max-Atom Problem and Its Relevance
- Stochastic Games with Perfect Information and Time Average Payoff
- Tractable constraints on ordered domains
This page was built for publication: Max-Closed Semilinear Constraint Satisfaction
