| Publication | Date of Publication | Type |
|---|
| Tensor reconstruction beyond constant rank | 2025-11-04 | Paper |
| Determinants vs. algebraic branching programs | 2025-11-04 | Paper |
| Optimal pseudorandom generators for low-degree polynomials over moderately large fields | 2025-10-06 | Paper |
A polynomial degree bound on equations for non-rigid matrices and small linear circuits
ACM Transactions on Computation Theory | 2025-02-21 | Paper |
Determinants vs. algebraic branching programs
Computational Complexity | 2024-10-25 | Paper |
scientific article; zbMATH DE number 7829342 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
| A lower bound on determinantal complexity | 2023-07-12 | Paper |
Pseudorandom Bits for Oblivious Branching Programs
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
| Extractors for Images of Varieties | 2022-11-26 | Paper |
A lower bound on determinantal complexity
Computational Complexity | 2022-10-21 | Paper |
Quadratic lower bounds for algebraic branching programs and formulas
Computational Complexity | 2022-08-01 | Paper |
| Lower bounds for matrix factorization | 2022-07-21 | Paper |
| A quadratic lower bound for algebraic branching programs | 2022-07-21 | Paper |
Lower bounds for matrix factorization
Computational Complexity | 2021-07-16 | Paper |
Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
Combinatorica | 2020-10-02 | Paper |
scientific article; zbMATH DE number 7250151 (Why is no real title available?)
(available as arXiv preprint) | 2020-09-22 | Paper |
A Lower Bound on Determinantal Complexity
(available as arXiv preprint) | 2020-09-04 | Paper |
| A Polynomial Degree Bound on Equations of Non-rigid Matrices and Small Linear Circuits | 2020-03-28 | Paper |
scientific article; zbMATH DE number 7009617 (Why is no real title available?)
Theory of Computing | 2019-01-31 | Paper |
Efficiently decoding Reed-Muller codes from random errors
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Succinct hitting sets and barriers to proving algebraic circuits lower bounds
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
On the structure of Boolean functions with small spectral norm
Computational Complexity | 2017-07-28 | Paper |
Efficiently Decoding Reed–Muller Codes From Random Errors
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On the structure of Boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Subexponential size hitting sets for bounded depth multilinear formulas
Computational Complexity | 2016-06-30 | Paper |
