A family of polycyclic groups over which the conjugacy problem is NP-complete.
Bren CavalloDelaram KahrobaeiPublished in: CoRR (2014)
Keyphrases
- np complete
- randomly generated
- satisfiability problem
- np hard
- special case
- computational complexity
- phase transition
- conjunctive queries
- polynomial time complexity
- polynomially solvable
- pspace complete
- sat problem
- constraint satisfaction problems
- evolutionary algorithm
- bounded treewidth
- np complete problems
- search space
- expert systems