Product-free Lambek calculus is NP-complete.

Published in: Ann. Pure Appl. Log. (2012)

Keyphrases

np complete
np hard
randomly generated
pspace complete
satisfiability problem
computational complexity
life cycle
constraint satisfaction problems
np complete problems
real time
data complexity
lower bound
website
product quality
neural network
bounded treewidth
databases