Product-Free Lambek Calculus Is NP-Complete.

Published in: LFCS (2009)

Keyphrases

np complete
randomly generated
computational complexity
np hard
life cycle
constraint satisfaction problems
satisfiability problem
data complexity
pspace complete
polynomial time complexity
databases
algebraic structure
real time
data management
phase transition