Sums-of-Products and Subproblem Independence
暂无分享,去创建一个
[1] Harry B. Hunt,et al. Resource Bounds and Subproblem Independence , 2005, Theory of Computing Systems.
[2] Umberto Bertelè,et al. Nonserial Dynamic Programming , 1972 .
[3] Harry B. Hunt,et al. Exploiting structure in quantified formulas , 2002, J. Algorithms.
[4] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[5] D. Rose,et al. Generalized nested dissection , 1977 .
[6] Harry B. Hunt,et al. Power indices and easier hard problems , 2005, Mathematical systems theory.
[7] DONALD MICHIE,et al. “Memo” Functions and Machine Learning , 1968, Nature.
[8] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .
[9] Harry B. Hunt,et al. An Algebraic Model for Combinatorial Problems , 1996, SIAM J. Comput..
[10] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[13] Arnon Rosenthal. Dynamic Programming is Optimal for Nonserial Optimization Problems , 1982, SIAM J. Comput..
[14] Christos H. Papadimitriou,et al. Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[15] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.