暂无分享,去创建一个
[1] Russell Impagliazzo,et al. Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.
[2] Marek Karpinski,et al. Polynomial time algorithms for modules over finite dimensional algebras , 1997, ISSAC.
[3] Thomas Thierauf,et al. Bipartite perfect matching is in quasi-NC , 2016, STOC.
[4] L. Lovász,et al. On Generic Rigidity in the Plane , 1982 .
[5] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .
[6] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[7] L. Segal. John , 2013, The Messianic Secret.
[8] Eugene M. Luks,et al. Testing isomorphism of modules , 2008 .
[9] Nitin Saxena,et al. Progress on Polynomial Identity Testing - II , 2014, Electron. Colloquium Comput. Complex..
[10] G. Laman. On graphs and rigidity of plane skeletal structures , 1970 .
[11] Shin-ichi Tanigawa. Generic Rigidity Matroids with Dilworth Truncations , 2012, SIAM J. Discret. Math..
[12] Avi Wigderson,et al. Operator Scaling: Theory and Applications , 2015, Found. Comput. Math..
[13] Nitin Saxena,et al. Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits , 2016, SIAM J. Comput..
[14] László Lovász,et al. Matroid matching and some applications , 1980, J. Comb. Theory, Ser. B.
[15] Meera Sitharam,et al. Handbook of Geometric Constraint Systems Principles , 2018 .
[16] H. Pollaczek-Geiringer. Über die Gliederung ebener Fachwerke , 1927 .
[17] Bruce Hendrickson,et al. Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..
[18] R. Meshulam. ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES , 1985 .
[19] Shin-ichi Tanigawa. Matroids of Gain Graphs in Applied Discrete Geometry , 2012, 1207.3601.
[20] András Frank,et al. Generalized polymatroids and submodular flows , 1988, Math. Program..
[21] B. Roth,et al. The rigidity of graphs , 1978 .
[22] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[23] H. Pollaczek-Geiringer,et al. Zur Gliederungstheorie räumlicher Fachwerke , 1932 .
[24] Tibor Jordán,et al. II – Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks , 2016 .
[25] Hong Liu,et al. Improved construction for universality of determinant and permanent , 2006, Inf. Process. Lett..
[26] László Lovász,et al. On determinants, matchings, and random algorithms , 1979, International Symposium on Fundamentals of Computation Theory.
[27] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory, Ser. B.
[28] Marek Karpinski,et al. Deterministic Polynomial Time Algorithms for Matrix Completion Problems , 2009, SIAM J. Comput..
[29] J. Geelen. Maximum rank matrix completion , 1999 .