Affine Consistency and the Complexity of Semilinear Constraints

DOI10.1007/978-3-662-44465-8_36zbMath1426.68126OpenAlexW574049463MaRDI QIDQ2922628

Peter Jonsson, Johan Thapper

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-112904

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Constraint satisfaction and semilinear expansions of addition over the rationals and the reals ⋮ Tractability conditions for numeric CSPs

This page was built for publication: Affine Consistency and the Complexity of Semilinear Constraints