Modular difference logic is hard

Details Modular difference logic is hard Modular difference logic is hard

2008-11-06

arxiv.org/abs/0811.0987v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Modular difference logic is hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modular difference logic is hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modular difference logic is hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631090