Solving the Broadcast Time Problem Using a D-wave Quantum Computer
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Aric Hagberg,et al. Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.
[3] N. Metropolis,et al. The Monte Carlo method. , 1949 .
[4] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[5] Michael R. Fellows,et al. Algebraic Constructions of Efficient Broadcast Networks , 1991, AAECC.
[6] Der-San Chen,et al. Applied Integer Programming: Modeling and Solution , 2010 .
[7] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[8] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[9] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.
[10] M Khosravani Moghadam,et al. Searching for Optimal Caterpillars in General and Bounded Treewidth Graphs , 2011 .
[11] Seth Lloyd,et al. Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[12] M. Sipser,et al. Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.
[13] Michael J. Dinneen. The complexity of broadcasting in bounded-degree networks , 1994, ArXiv.
[14] V. Fock,et al. Beweis des Adiabatensatzes , 1928 .
[15] M. Juncosa,et al. The Monte Carlo Method (Yu. A. Shreider) , 1970 .
[16] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[17] Arthur M. Farley,et al. Minimum broadcast graphs , 1979, Discret. Math..