The Lambek-Grishin calculus is NP-complete

Details The Lambek-Grishin calculus is NP-complete The Lambek-Grishin calculus is NP-complete

2010-05-25

arxiv.org/abs/1005.4697v3

Computer Science

Computation and Language

Scientific paper

The Lambek-Grishin calculus LG is the symmetric extension of the
non-associative Lambek calculus NL. In this paper we prove that the
derivability problem for LG is NP-complete.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-604577