暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes , 2014, APPROX-RANDOM.
[2] Ramprasad Saptharishi,et al. Hitting sets for multilinear read-once algebraic branching programs, in any order , 2014, STOC.
[3] Lap Chi Lau,et al. Fast matrix rank algorithms and applications , 2012, JACM.
[4] Ran Raz,et al. Extractors with weak random seeds , 2005, STOC '05.
[5] A. Wigderson,et al. ENTROPY WAVES, THE ZIG-ZAG GRAPH PRODUCT, AND NEW CONSTANT-DEGREE , 2004, math/0406038.
[6] Zeev Dvir,et al. Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits , 2007, SIAM J. Comput..
[7] Dániel Marx,et al. A parameterized view on matroid optimization problems , 2009, Theor. Comput. Sci..
[8] Aram Wettroth Harrow,et al. Quantum expanders from any classical Cayley graph expander , 2007, Quantum Inf. Comput..
[9] Venkatesan Guruswami,et al. List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound , 2013, STOC '13.
[10] Venkatesan Guruswami,et al. Explicit rank-metric codes list-decodable with optimal redundancy , 2013, Electron. Colloquium Comput. Complex..
[11] J. Bourgain. Expanders and dimensional expansion , 2009 .
[12] Avraham Ben-Aroya,et al. A Note on Subspace Evasive Sets , 2012, Chicago J. Theor. Comput. Sci..
[13] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.
[14] Ran Raz,et al. Deterministic extractors for affine sources over large fields , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[15] Ran Raz,et al. Deterministic polynomial identity testing in non-commutative models , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[16] Amir Shpilka,et al. Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[17] Avi Wigderson,et al. Extractors And Rank Extractors For Polynomial Sources , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[18] A. Lubotzky,et al. Dimension expanders , 2008, 0804.0481.
[19] Ramprasad Saptharishi,et al. Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order , 2013, Electron. Colloquium Comput. Complex..
[20] Nitin Saxena,et al. Quasi-polynomial hitting-set for set-depth-Δ formulas , 2012, STOC '13.
[21] Nitin Saxena,et al. Quasi-polynomial Hitting-set for Set-depth-Delta Formulas , 2012, Electron. Colloquium Comput. Complex..
[22] Avi Wigderson,et al. Monotone Expanders: Constructions and Applications , 2010, Theory Comput..
[23] Venkatesan Guruswami,et al. Folded codes from function field towers and improved optimal rate list decoding , 2012, STOC '12.
[24] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes , 2013, IEEE Transactions on Information Theory.
[25] Ron M. Roth,et al. Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction' , 1991, IEEE Trans. Inf. Theory.
[26] Zeev Dvir,et al. Towards dimension expanders over finite fields , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[27] Vojtech Rödl,et al. Pseudorandom sets and explicit constructions of ramsey graphs , 2004 .
[28] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[29] Amir Shpilka,et al. On identity testing of tensors, low-rank recovery and compressed sensing , 2011, STOC '12.
[30] Guy Kindler,et al. Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors , 2005, STOC '05.
[31] Michael A. Forbes. Polynomial identity testing of read-once oblivious algebraic branching programs , 2014 .
[32] Philippe Delsarte,et al. Bilinear Forms over a Finite Field, with Applications to Coding Theory , 1978, J. Comb. Theory, Ser. A.
[33] Venkatesan Guruswami,et al. Explicit subspace designs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[34] Venkatesan Guruswami,et al. Linear-Algebraic List Decoding of Folded Reed-Solomon Codes , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[35] Shachar Lovett,et al. Subspace Evasive Sets , 2011, Electron. Colloquium Comput. Complex..
[36] Venkatesan Guruswami,et al. Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.