The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete.
Olga KharlampovichI. G. LysënokAlexei G. MyasnikovNicholas W. M. TouikanPublished in: Theory Comput. Syst. (2010)
Keyphrases
- np complete
- computational complexity
- randomly generated
- np hard
- constraint satisfaction problems
- polynomial time complexity
- objective function
- numerical solution
- databases
- satisfiability problem
- phase transition
- data sets
- globally convergent
- data complexity
- conjunctive queries
- neural network
- multiscale
- special case
- cluster analysis
- differential equations
- database systems
- relational databases
- search algorithm