Ben Lee Volk

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 57

Top Topics

Reduced Error Pruning

Complexity Theory

Top Venues

Electron. Colloquium Comput. Complex.

Computational Complexity Conference

Publications

Ashish Dwivedi, Zeyu Guo, Ben Lee Volk
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. CoRR (2024)
Ben Lee Volk
SIGACT News Complexity Theory Column 120. SIGACT News 55 (1) (2024)
Ben Lee Volk
SIGACT News Complexity Theory Column 121. SIGACT News 55 (2) (2024)
Ashish Dwivedi, Zeyu Guo, Ben Lee Volk
Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. Electron. Colloquium Comput. Complex. (2024)
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. CoRR (2024)
Shir Peleg, Amir Shpilka, Ben Lee Volk
Tensor Reconstruction Beyond Constant Rank. ITCS (2024)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. ITCS (2024)
Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, Ben Lee Volk
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. Electron. Colloquium Comput. Complex. (2024)
Ben Lee Volk
SIGACT News Complexity Theory Column 119. SIGACT News 54 (4) (2023)
Ben Lee Volk
SIGACT News Complexity Theory Column 118. SIGACT News 54 (2) (2023)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. Electron. Colloquium Comput. Complex. (2023)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. CoRR (2023)
Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
Extractors for Images of Varieties. STOC (2023)
Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
Extractors for Images of Varieties. CoRR (2022)
Shir Peleg, Amir Shpilka, Ben Lee Volk
Tensor Reconstruction Beyond Constant Rank. Electron. Colloquium Comput. Complex. (2022)
Shir Peleg, Amir Shpilka, Ben Lee Volk
Tensor Reconstruction Beyond Constant Rank. CoRR (2022)
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. Comput. Complex. 31 (2) (2022)
Zeyu Guo, Ben Lee Volk, Akhil Jalan, David Zuckerman
Extractors for Images of Varieties. Electron. Colloquium Comput. Complex. (2022)
Shir Peleg, Amir Shpilka, Ben Lee Volk
Lower Bounds on Stabilizer Rank. Quantum 6 (2022)
Ben Lee Volk, Mrinal Kumar
A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits. ACM Trans. Comput. Theory 14 (2) (2022)
Shir Peleg, Ben Lee Volk, Amir Shpilka
Lower Bounds on Stabilizer Rank. ITCS (2022)
Mrinal Kumar, Ben Lee Volk
A Lower Bound on Determinantal Complexity. Comput. Complex. 31 (2) (2022)
Ben Lee Volk
Guest Column: Algebraic Natural Proofs Ben Lee Volk. SIGACT News 52 (4) (2021)
Shir Peleg, Amir Shpilka, Ben Lee Volk
Lower Bounds on Stabilizer Rank. CoRR (2021)
Mrinal Kumar, Ben Lee Volk
A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits. ITCS (2021)
Mrinal Kumar, Ben Lee Volk
A Lower Bound on Determinantal Complexity. Computational Complexity Conference (2021)
Shir Peleg, Amir Shpilka, Ben Lee Volk
Lower Bounds on Stabilizer Rank. Electron. Colloquium Comput. Complex. 28 (2021)
Ben Lee Volk, Mrinal Kumar
Lower Bounds for Matrix Factorization. Comput. Complex. 30 (1) (2021)
Mrinal Kumar, Ben Lee Volk
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. Electron. Colloquium Comput. Complex. 27 (2020)
Rohit Gurjar, Ben Lee Volk
Pseudorandom Bits for Oblivious Branching Programs. ACM Trans. Comput. Theory 12 (2) (2020)
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
A Quadratic Lower Bound for Algebraic Branching Programs. Computational Complexity Conference (2020)
Mrinal Kumar, Ben Lee Volk
A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. CoRR (2020)
Mrinal Kumar, Ben Lee Volk
Lower Bounds for Matrix Factorization. Computational Complexity Conference (2020)
Noga Alon, Mrinal Kumar, Ben Lee Volk
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Comb. 40 (2) (2020)
Mrinal Kumar, Ben Lee Volk
A Lower Bound on Determinantal Complexity. CoRR (2020)
Mrinal Kumar, Ben Lee Volk
A Lower Bound on Determinantal Complexity. Electron. Colloquium Comput. Complex. 27 (2020)
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
A Quadratic Lower Bound for Algebraic Branching Programs. CoRR (2019)
Mrinal Kumar, Ben Lee Volk
Lower Bounds for Matrix Factorization. Electron. Colloquium Comput. Complex. 26 (2019)
Mrinal Kumar, Ben Lee Volk
Lower Bounds for Matrix Factorization. CoRR (2019)
Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk
A Quadratic Lower Bound for Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 26 (2019)
Noga Alon, Mrinal Kumar, Ben Lee Volk
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Computational Complexity Conference (2018)
Michael A. Forbes, Amir Shpilka, Ben Lee Volk
Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits. Theory Comput. 14 (1) (2018)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Oblivious Algebraic Branching Programs. ACM Trans. Comput. Theory 10 (1) (2018)
Michael A. Forbes, Amir Shpilka, Ben Lee Volk
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. Electron. Colloquium Comput. Complex. 24 (2017)
Mrinal Kumar, Ben Lee Volk
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. Electron. Colloquium Comput. Complex. 24 (2017)
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Efficiently Decoding Reed-Muller Codes From Random Errors. IEEE Trans. Inf. Theory 63 (4) (2017)
Rohit Gurjar, Ben Lee Volk
Pseudorandom Bits for Oblivious Branching Programs. Electron. Colloquium Comput. Complex. 24 (2017)
Rohit Gurjar, Ben Lee Volk
Pseudorandom Bits for Oblivious Branching Programs. CoRR (2017)
Michael A. Forbes, Amir Shpilka, Ben Lee Volk
Succinct hitting sets and barriers to proving algebraic circuits lower bounds. STOC (2017)
Mrinal Kumar, Ben Lee Volk
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. CoRR (2017)
Michael A. Forbes, Amir Shpilka, Ben Lee Volk
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. CoRR (2017)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. Computational Complexity Conference (2016)
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Efficiently decoding Reed-Muller codes from random errors. STOC (2016)
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Decoding high rate Reed-Muller codes from random errors in near linear time. CoRR (2015)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs. CoRR (2015)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 22 (2015)
Rafael Mendes de Oliveira, Amir Shpilka, Ben Lee Volk
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Computational Complexity Conference (2015)
Rafael Mendes de Oliveira, Amir Shpilka, Ben Lee Volk
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. CoRR (2014)
Rafael Mendes de Oliveira, Amir Shpilka, Ben Lee Volk
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Electron. Colloquium Comput. Complex. 21 (2014)