A family of polycyclic groups over which the uniform conjugacy problem is NP-complete.
Bren CavalloDelaram KahrobaeiPublished in: Int. J. Algebra Comput. (2014)
Keyphrases
- np complete
- np hard
- randomly generated
- computational complexity
- constraint satisfaction problems
- polynomially solvable
- satisfiability problem
- pspace complete
- information retrieval
- polynomial time complexity
- special case
- databases
- np complete problems
- finds an optimal solution
- phase transition
- sat problem
- group members
- conjunctive queries
- database systems
- neural network