Bounded Second-Order Unification Is NP-Complete.
Jordi LevyManfred Schmidt-SchaußMateu VillaretPublished in: RTA (2006)
Keyphrases
- np complete
- higher order
- bounded treewidth
- np hard
- randomly generated
- constraint satisfaction problems
- satisfiability problem
- computational complexity
- high order
- np complete problems
- constraint satisfaction
- conjunctive queries
- polynomial time complexity
- theorem prover
- polynomially solvable
- equational theories
- finds an optimal solution
- pspace complete
- data sets
- hessian matrix
- conp complete
- fixed parameter tractable
- search algorithm
- case study