Login / Signup

On the parameterized complexity of associative and commutative unification.

Tatsuya AkutsuJesper JanssonAtsuhiro TakasuTakeyuki Tamura
Published in: Theor. Comput. Sci. (2017)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • global constraints
  • theorem proving
  • special case
  • theorem prover
  • symmetry breaking
  • np hard
  • graph structure
  • integer linear programming