Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A. Adachi, S. Iwata, and T. Kasai. Some combinatorial game problems require Ω(n k) time. J. ACM, 31:361–376, 1984.
2. Technical Report;H. L. Bodlaender,1986
3. H. L. Bodlaender. Improved self-reduction algorithms for graphs with bounded treewidth. Technical Report RUU-CS-88-29, Dept. of Computer Science, Utrecht University, 1988. To appear in: Proc. Workshop on Graph Theoretic Concepts in Comp. Sc. '89.
4. S. Even and R. Tarjan. A combinatorial problem which is complete in polynomial space. J. ACM, 23:710–719, 1976.
5. A. Fraenkel, M. Garey, D. Johnson, T. Schaefer, and Y. Yesha. The complexity of checkers on an n × n board — preliminary version. In Proc. 19th Annual Symp. on Foundations of Computer Science, pages 55–64, 1978.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献