暂无分享,去创建一个
[1] T. Lindvall. ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.
[2] S. E. Dreyfus,et al. The steiner problem in graphs , 1971, Networks.
[3] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[4] Noga Alon,et al. The monotone circuit complexity of boolean functions , 1987, Comb..
[5] Dima Grigoriev,et al. Subtraction-Free Complexity, Cluster Transformations, and Spanning Trees , 2013, Found. Comput. Math..
[6] C. Carathéodory. Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen , 1907 .
[7] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[8] Stasys Jukna,et al. Tropical Complexity, Sidon Sets, and Dynamic Programming , 2016, SIAM J. Discret. Math..
[9] Mark Jerrum,et al. Some Exact Complexity Results for Straight-Line Computations over Semirings , 1982, JACM.
[10] Igor S. Sergeev,et al. A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials , 2012 .
[11] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.
[12] A. Razborov. Lower bounds on monotone complexity of the logical permanent , 1985 .
[13] N. J. A. Sloane,et al. Lower bounds for constant weight codes , 1980, IEEE Trans. Inf. Theory.
[14] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[15] R. Rado. A THEOREM ON INDEPENDENCE RELATIONS , 1942 .
[16] Nikhil Bansal,et al. On the number of matroids , 2013, SODA.
[17] D. J. A. Welsh,et al. On the Number of Combinatorial Geometries , 1971 .
[18] L. R. Ford,et al. NETWORK FLOW THEORY , 1956 .
[19] James G. Oxley,et al. Matroid theory , 1992 .
[20] A. Tucker,et al. Linear Inequalities And Related Systems , 1956 .
[21] B. Lindström. Determination of two vectors from the sum , 1969 .
[22] Donald E. Knuth,et al. The Asymptotic Number of Geometries , 1974, J. Comb. Theory A.