Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs.

Boaz Barak Kunal Marwaha

Published in: ITCS (2022)

Keyphrases

significant improvement
orders of magnitude
times faster
graph theory
learning algorithm
wide range
data structure
computational complexity
theoretical analysis
convergence rate
computational cost
optimization problems
computationally efficient
maximum clique