| Publication | Date of Publication | Type |
|---|
Deterministic algorithms for low degree factors of constant depth circuits
| 2024-11-28 | Paper |
Determinants vs. algebraic branching programs
Computational Complexity | 2024-10-25 | Paper |
Ideal-theoretic explanation of capacity-achieving decoding
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Decoding multivariate multiplicity codes on product sets
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
If VNP is hard, then so are equations for it
| 2024-04-23 | Paper |
Near-optimal bootstrapping of hitting sets for algebraic models
Theory of Computing | 2024-01-16 | Paper |
Fast, algebraic multivariate multipoint evaluation in small characteristic and applications
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7768401 (Why is no real title available?)
| 2023-11-20 | Paper |
Decoding multivariate multiplicity codes on product sets
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758331 (Why is no real title available?)
| 2023-10-31 | Paper |
A lower bound on determinantal complexity
| 2023-07-12 | Paper |
Schur polynomials do not have small formulas if the determinant does not
Computational Complexity | 2023-07-10 | Paper |
Monotone circuit lower bounds from robust sunflowers
Algorithmica | 2022-12-08 | Paper |
On the power of border of depth-3 arithmetic circuits
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
A lower bound on determinantal complexity
Computational Complexity | 2022-10-21 | Paper |
Monotone circuit lower bounds from robust sunflowers
LATIN 2020: Theoretical Informatics | 2022-10-13 | 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 |
scientific article; zbMATH DE number 7561742 (Why is no real title available?)
| 2022-07-21 | Paper |
Derandomization from Algebraic Hardness
SIAM Journal on Computing | 2022-05-03 | Paper |
Detection and prediction of equilibrium states in kinetic plasma simulations via mode tracking using reduced-order dynamic mode decomposition
Journal of Computational Physics | 2022-04-29 | Paper |
Algorithmizing the Multiplicity Schwartz-Zippel Lemma
| 2021-11-22 | Paper |
Method for solving chance constrained optimal control problems using biased kernel density estimators
Optimal Control Applications & Methods | 2021-07-22 | 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 7250153 (Why is no real title available?)
| 2020-09-22 | Paper |
scientific article; zbMATH DE number 7250151 (Why is no real title available?)
| 2020-09-22 | Paper |
A Lower Bound on Determinantal Complexity
| 2020-09-04 | Paper |
A quadratic lower bound for homogeneous algebraic branching programs
| 2020-05-26 | Paper |
scientific article; zbMATH DE number 7204282 (Why is no real title available?)
| 2020-05-26 | Paper |
A Polynomial Degree Bound on Equations of Non-rigid Matrices and Small Linear Circuits
| 2020-03-28 | Paper |
scientific article; zbMATH DE number 7150624 (Why is no real title available?)
| 2020-01-13 | Paper |
Arithmetic circuit lower bounds via maximum-rank of partial derivative matrices
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Closure results for polynomial factorization
Theory of Computing | 2019-12-05 | Paper |
Near-optimal bootstrapping of hitting sets for algebraic circuits
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A quadratic lower bound for homogeneous algebraic branching programs
Computational Complexity | 2019-08-30 | Paper |
The computational power of depth five arithmetic circuits
SIAM Journal on Computing | 2019-03-22 | Paper |
Finer separations between shallow arithmetic circuits
| 2018-04-19 | Paper |
On the effectiveness of Monte Carlo for initial uncertainty forecasting in nonlinear dynamical systems
Automatica | 2018-01-23 | Paper |
Arithmetic circuits with locally low algebraic rank
Theory of Computing | 2017-10-11 | Paper |
Sums of products of polynomials in few variables: lower bounds and polynomial identity testing
| 2017-10-10 | Paper |
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
| 2017-10-10 | Paper |
Arithmetic circuits with locally low algebraic rank
| 2017-10-10 | Paper |
Numerical solution of high dimensional stationary Fokker-Planck equations via tensor decomposition and Chebyshev spectral differentiation
Computers & Mathematics with Applications | 2017-07-18 | Paper |
On the power of homogeneous depth 4 arithmetic circuits
SIAM Journal on Computing | 2017-03-10 | Paper |
Towards an algebraic natural proofs barrier via polynomial identity testing
| 2017-01-06 | Paper |
A numerical solver for high dimensional transient Fokker-Planck equation in modeling polymeric fluids
Journal of Computational Physics | 2016-12-20 | Paper |
Efficient indexing of necklaces and irreducible polynomials over finite fields
Theory of Computing | 2016-08-22 | Paper |
The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
SIAM Journal on Computing | 2015-11-18 | Paper |
The limits of depth reduction for arithmetic formulas
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Faster parameterized algorithms for deletion to split graphs
Algorithmica | 2015-06-25 | Paper |
An information guided framework for simulated annealing
Journal of Global Optimization | 2015-06-18 | Paper |
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
Automata, Languages, and Programming | 2014-07-01 | Paper |
Efficient indexing of necklaces and irreducible polynomials over finite fields
Automata, Languages, and Programming | 2014-07-01 | Paper |
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
Theoretical Computer Science | 2014-03-13 | Paper |
Arithmetic circuit lower bounds via MaxRank
Automata, Languages, and Programming | 2013-08-06 | Paper |
Faster parameterized algorithms for deletion to split graphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Approximation algorithms for minimum chain vertex deletion
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
