Funder
Ames Research Center
Defense Advanced Research Projects Agency
NASA Academic Mission Services
Argonne National Laboratory
Advanced Scientific Computing Research
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modelling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference86 articles.
1. Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comput. Syst. Sci. 58(1), 193–210 (1999)
2. Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505–510 (2019)
3. Arute, F. et al.: Quantum approximate optimization of non-planar graph problems on a planar superconducting processor. arXiv:2004.04197 (2020)
4. Arving, V.: Lecture notes (2007). www.cmi.ac.in/~ramprasad/lecturenotes/algcomp/tillnow.pdf. [Online.]
5. Babai, László: Graph isomorphism in quasipolynomial time. arXiv:1512.03547 (2015)
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献