Author:
Makino Kazuhisa,Tamaki Suguru,Yamamoto Masaki
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. Dynamic programming treatment of the travelling salesman problem;Bellman;Journal of the ACM,1962
2. A. Björklund, T. Husfeldt, P. Kaski, M. Koivisto, The travelling salesman problem in bounded degree graphs, in: Proc. ICALP 2008 part I, 2008, pp. 198–209.
3. A. Björklund, T. Husfeldt, P. Kaski, M. Koivisto, Fourier meets Möbius: Fast subset convolution, in: Proc. STOC 2007, 2007, pp. 67–74.
4. A. Björklund, T. Husfeldt, Inclusion–exclusion algorithms for counting set partitions, in: Proc. FOCS 2006, 2006, pp. 575–582.
5. C. Calabro, The exponential complexity of satisfiability problems, Ph.D. Thesis, University of California, San Diego, 2009.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献