The Lambek-Grishin Calculus Is NP-Complete

DOI10.1007/978-3-642-32024-8_3zbMATH Open1333.03010OpenAlexW1669274659MaRDI QIDQ3167299FDOQ3167299

Authors: Jeroen Bransen 

Publication date: 2 November 2012

Published in: Formal Grammar (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32024-8_3

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cited In (3)

• LaserTank is NP-Complete
• Title not available (Why is that?)
• Lambek calculus is NP-complete

This page was built for publication: The Lambek-Grishin Calculus Is NP-Complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167299)