Rigid E-Unification is NP-Complete
Jean H. GallierWayne SnyderPaliath NarendranDavid A. PlaistedPublished in: LICS (1988)
Keyphrases
- np complete
- computational complexity
- randomly generated
- np hard
- pspace complete
- satisfiability problem
- higher order
- constraint satisfaction problems
- np complete problems
- equational theories
- polynomial time complexity
- conjunctive queries
- three dimensional
- theorem proving
- real time
- theorem prover
- knowledge base
- automated theorem proving
- conp complete
- phase transition
- rigid body
- computer vision
- bounded treewidth
- neural network
- computationally complex
- databases