Two-sided unification is NP-complete.
Tatyana A. NovikovaVladimir A. ZakharovPublished in: UNIF (2014)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- higher order
- equational theories
- constraint satisfaction problems
- computational complexity
- theorem proving
- bounded treewidth
- conjunctive queries
- pspace complete
- polynomial time complexity
- learning algorithm
- phase transition
- automated theorem proving
- upper bound
- theorem prover
- machine learning
- data complexity
- np complete problems
- polynomially solvable
- database