Author:
Srinivasan Madhan Kumar,Gajula Kishore Kumar
Reference19 articles.
1. Crosson, E., Harrow, A.W.: Simulated quantum annealing can be exponentially faster than classical simulated annealing. In: 57th Annual Symposium on Foundations of Computer Science (FOCS), pp 714–723. IEEE (2016)
2. Crosson E, Deng M (2021) Cornell university arxiv homepage. https://arxiv.org/abs/1410.8484. Last Accessed 11 Jan 2021
3. Papadimitriou, C.H., Kenneth, S.: Combinatorial optimization: algorithms and complexity. Unabridged edn, Dover (1998)
4. Vazirani, V.V.: Approximation Algorithms, 2nd edn. Springer, Berlin (2003)
5. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)