Modular difference logic is hard
Computational Complexity
2008-11-07 v1
Abstract
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k \leq y + k'. Over integers, the satisfiability problem for such systems is polynomial time. The problem becomes NP complete if we restrict attention to the residues for a fixed modulus N.
Cite
@article{arxiv.0811.0987,
title = {Modular difference logic is hard},
author = {Nikolaj Bjørner and Andreas Blass and Yuri Gurevich and Madan Musuvathi},
journal= {arXiv preprint arXiv:0811.0987},
year = {2008}
}