Knuth-Bendix constraint solving is NP-complete

Details Knuth-Bendix constraint solving is NP-complete Knuth-Bendix constraint solving is NP-complete

2002-07-17

arxiv.org/abs/cs/0207068v1

Computer Science

Logic in Computer Science

27 pages

Scientific paper

We show the NP-completeness of the existential theory of term algebras with
the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm
for solving Knuth-Bendix ordering constraints.

Affiliated with

Also associated with

No associations

Rating

Knuth-Bendix constraint solving is NP-complete 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 Knuth-Bendix constraint solving is NP-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Knuth-Bendix constraint solving is NP-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561597