暂无分享,去创建一个
[1] Nikhil Srivastava,et al. Twice-ramanujan sparsifiers , 2008, STOC '09.
[2] David P. Woodruff,et al. The Sketching Complexity of Graph Cuts , 2014, ArXiv.
[3] Shang-Hua Teng,et al. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.
[4] N. Srivastava,et al. Discrepancy, Graphs, and the Kadison-Singer Problem , 2013 .
[5] D. Spielman,et al. Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem , 2013, 1306.3969.