E-LIB Suche - Ergebnisse für: Volk, Ben Lee

1

Extractors for Images of Varieties:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Guo, Zeyu ; Volk, Ben Lee ; Jalan, Akhil. - p. 46-59 , 2023

Link: https://dl.acm.org/doi/1..

2

Lower Bounds on Stabilizer Rank:

Peleg, Shir ; Shpilka, Amir ; Volk, Ben Lee
Quantum. 6 (2022) - p. 652 , 2022

Link: https://doi.org/10.22331..

3

A Lower Bound on Determinantal Complexity:

Kumar, Mrinal ; Volk, Ben Lee
computational complexity. 31 (2022) 2 - p. , 2022

Link: https://doi.org/10.1007/..

4

A Polynomial Degree Bound on Equations for Non-rigid Matric..:

Volk, Ben Lee ; Kumar, Mrinal
ACM Transactions on Computation Theory. 14 (2022) 2 - p. 1-14 , 2022

Link: https://doi.org/10.1145/..

5

Guest Column: Algebraic Natural Proofs Ben Lee Volk:

Volk, Ben Lee
ACM SIGACT News. 52 (2021) 4 - p. 56-73 , 2021

Link: https://doi.org/10.1145/..

6

Lower Bounds for Matrix Factorization:

Volk, Ben Lee ; Kumar, Mrinal
computational complexity. 30 (2021) 1 - p. , 2021

Link: https://doi.org/10.1007/..

7

A lower bound on determinantal complexity:

, In: Proceedings of the 36th Computational Complexity Conference,

Kumar, Mrinal ; Volk, Ben Lee - p. 1 ff. , 2021

Link: https://dl.acm.org/doi/1..

8

Lower bounds for matrix factorization:

, In: Proceedings of the 35th Computational Complexity Conference,

Kumar, Mrinal ; Volk, Ben Lee - p. 1-20 , 2020

Link: https://dl.acm.org/doi/1..

9

A quadratic lower bound for algebraic branching programs:

, In: Proceedings of the 35th Computational Complexity Conference,

Chatterjee, Prerona ; Kumar, Mrinal ; She, Adrian. - p. 1-21 , 2020

Link: https://dl.acm.org/doi/1..

10

Pseudorandom Bits for Oblivious Branching Programs:

Gurjar, Rohit ; Volk, Ben Lee
ACM Transactions on Computation Theory. 12 (2020) 2 - p. 1-12 , 2020

Link: https://doi.org/10.1145/..

11

Unbalancing Sets and An Almost Quadratic Lower Bound for Sy..:

Alon, Noga ; Kumar, Mrinal ; Volk, Ben Lee
Combinatorica. 40 (2020) 2 - p. 149-178 , 2020

Link: https://doi.org/10.1007/..

12

Pseudorandom Bits for Oblivious Branching Programs:

Gurjar, Rohit ; Volk, Ben Lee
ACM Transactions on Computation Theory (TOCT). 12 (2020) 2 - p. 1-12 , 2020

Link: https://dl.acm.org/doi/1..

13

Identity Testing and Lower Bounds for Read-kOblivious Algeb..:

Anderson, Matthew ; Forbes, Michael A. ; Saptharishi, Ramprasad..
ACM Transactions on Computation Theory. 10 (2018) 1 - p. 1-30 , 2018

Link: https://doi.org/10.1145/..

14

Unbalancing sets and an almost quadratic lower bound for sy..:

, In: Proceedings of the 33rd Computational Complexity Conference,

Alon, Noga ; Kumar, Mrinal ; Volk, Ben Lee - p. 1-16 , 2018

Link: https://dl.acm.org/doi/1..

15

Identity Testing and Lower Bounds for Read-k Oblivious Alge..:

Anderson, Matthew ; Forbes, Michael A. ; Saptharishi, Ramprasad..
ACM Transactions on Computation Theory (TOCT). 10 (2018) 1 - p. 1-30 , 2018

Link: https://dl.acm.org/doi/1..