A Heuristic Subexponential Algorithm to Find Paths in Markoff Graphs Over Finite Fields.
Joseph H. SilvermanPublished in: CoRR (2022)
Keyphrases
- optimal solution
- dynamic programming
- times faster
- learning algorithm
- computational complexity
- linear programming
- simulated annealing
- combinatorial optimization
- matching algorithm
- closest string
- running times
- minimum spanning tree
- path finding
- detection algorithm
- optimization algorithm
- particle swarm optimization
- np hard
- undirected graph
- optimal path
- probabilistic model
- random graphs
- graph construction
- bin packing
- search space
- search algorithm