Author:
Dinh Hang,Russell Alexander
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Aardal, K., van Hoesel, S., Lenstra, J.K., Stougie, L.: A decade of combinatorial optimization. In: CWI Tracts, vol. 122, pp. 5–14 (1997)
2. Aaronson, S.: Lower bounds for local search by quantum arguments. In: STOC 2004: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (2004)
3. Aldous, D.: Minimization algorithms and random walk on the d-cube. Annals of Probability 11(2), 403–413 (1983)
4. Ambainis, A.: Quantum lower bounds by quantum arguments. In: STOC 2000: Proceedings of the thirty-second annual ACM symposium on Theory of computing (2000)
5. Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups. In: STOC 1991: Proceedings of the twenty-third annual ACM symposium on Theory of computing, pp. 164–174. ACM, New York (1991)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Figure Credits;The Nature of Computation;2011-08-11
2. Copyright Page;The Nature of Computation;2011-08-11
3. Mathematical Tools;The Nature of Computation;2011-08-11
4. Preface;The Nature of Computation;2011-08-11
5. Dedication;The Nature of Computation;2011-08-11