A Polynomial Time Algorithm For The Conjugacy Decision and Search Problems in Free Abelian-by-Infinite Cyclic Groups.
Bren CavalloDelaram KahrobaeiPublished in: CoRR (2014)
Keyphrases
- computational complexity
- search problems
- search space
- objective function
- worst case
- np hard
- search algorithm
- learning algorithm
- combinatorial search
- special case
- dynamic programming
- probabilistic model
- constraint satisfaction problems
- heuristic search
- domain independent
- constraint satisfaction
- search strategy
- path finding
- state space search