Login / Signup
Tightening the Complexity of Equivalence Problems for Commutative Grammars.
Christoph Haase
Piotr Hofman
Published in:
CoRR (2015)
Keyphrases
</>
decision problems
computational cost
np hardness
database
multi agent
natural language
query language
multi class
optimization problems
np complete
benchmark problems
problems involving
solving problems