Semilinear Program Feasibility

DOI10.1007/978-3-642-02930-1_7zbMath1248.68236OpenAlexW1575877321MaRDI QIDQ3638087

Manuel Bodirsky, Peter Jonsson, Timo von Oertzen

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Tropically convex constraint satisfaction ⋮ Max-Closed Semilinear Constraint Satisfaction

This page was built for publication: Semilinear Program Feasibility