Sciweavers

CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 5 months ago
Modular difference logic is hard
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...