Computational complexity of linear constraints over the integers
From MaRDI portal
Publication:360099
DOI10.1016/j.artint.2012.10.001zbMath1270.68116OpenAlexW2047084573MaRDI QIDQ360099
Publication date: 26 August 2013
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370212001221
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (11)
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals ⋮ Constraint Satisfaction Problems over the Integers with Successor ⋮ Tropically convex constraint satisfaction ⋮ Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ An interdisciplinary experimental evaluation on the disjunctive temporal problem ⋮ Unnamed Item ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Tractability conditions for numeric CSPs ⋮ Max-Closed Semilinear Constraint Satisfaction ⋮ Constructing NP-intermediate problems by blowing holes with parameters of various properties
This page was built for publication: Computational complexity of linear constraints over the integers
