| Publication | Date of Publication | Type |
|---|
| Young flattenings in the Schur module basis | 2026-03-10 | Paper |
| Functional closure properties of finite \(\mathbb{N}\)-weighted automata | 2026-01-14 | Paper |
Geometric complexity theory for product-plus-power
Journal of Symbolic Computation | 2025-12-02 | Paper |
| On the power of border width-2 ABPs over fields of characteristic 2 | 2025-11-10 | Paper |
| Fixed-parameter debordering of Waring rank | 2025-11-10 | Paper |
| Homogeneous algebraic complexity theory and algebraic formulas | 2025-11-04 | Paper |
| What is in \(\#\mathsf{P}\) and what is not? | 2025-08-15 | Paper |
| Rectangular Kronecker coefficients and plethysms in geometric complexity theory | 2025-08-06 | Paper |
| No occurrence obstructions in geometric complexity theory | 2025-08-06 | Paper |
All Kronecker coefficients are reduced Kronecker coefficients
Forum of Mathematics, Pi | 2024-11-24 | Paper |
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
IMRN. International Mathematics Research Notices | 2024-10-25 | Paper |
| Karchmer-Wigderson games for hazard-free computation | 2024-09-25 | Paper |
| Degree-restricted strength decompositions and algebraic branching programs | 2024-09-12 | Paper |
| scientific article; zbMATH DE number 7788490 (Why is no real title available?) | 2024-01-15 | Paper |
| Homogeneous Algebraic Complexity Theory and Algebraic Formulas | 2023-11-28 | Paper |
scientific article; zbMATH DE number 7711611 (Why is no real title available?)
(available as arXiv preprint) | 2023-07-12 | Paper |
| A remark on the quantum complexity of the Kronecker coefficients | 2023-07-05 | Paper |
| All Kronecker coefficients are reduced Kronecker coefficients | 2023-05-04 | Paper |
| De-bordering and Geometric Complexity Theory for Waring rank and related models | 2022-11-13 | Paper |
scientific article; zbMATH DE number 7561749 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561544 (Why is no real title available?) | 2022-07-21 | Paper |
| Positivity of the symmetric group characters is as hard as the polynomial time hierarchy | 2022-07-12 | Paper |
| Degree-restricted strength decompositions and algebraic branching programs | 2022-05-04 | Paper |
Equations for GL invariant families of polynomials
Vietnam Journal of Mathematics | 2022-05-04 | Paper |
| What is in #P and what is not? | 2022-04-27 | Paper |
A note on VNP-completeness and border complexity
Information Processing Letters | 2022-04-07 | Paper |
The computational complexity of plethysm coefficients
Computational Complexity | 2021-05-25 | Paper |
| Young Flattenings in the Schur module basis | 2021-04-06 | Paper |
Implementing geometric complexity theory: on the separation of orbit closures via symmetries
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions
SIAM Journal on Applied Algebra and Geometry | 2020-07-13 | Paper |
| On algebraic branching programs of small width | 2020-05-26 | Paper |
On the complexity of hazard-free circuits
Journal of the ACM | 2020-02-11 | Paper |
| Hyperpfaffians and Geometric Complexity Theory | 2019-12-19 | Paper |
Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective
Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche | 2019-12-17 | Paper |
Implementing geometric complexity theory: On the separation of orbit closures via symmetries
(available as arXiv preprint) | 2019-11-10 | Paper |
| Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory | 2019-11-06 | Paper |
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings
(available as arXiv preprint) | 2019-10-02 | Paper |
Generalized matrix completion and algebraic natural proofs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
On the complexity of hazard-free circuits
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices
Experimental Mathematics | 2019-08-13 | Paper |
The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
Journal of Pure and Applied Algebra | 2019-04-25 | Paper |
On Algebraic Branching Programs of Small Width
Journal of the ACM | 2019-02-25 | Paper |
On Algebraic Branching Programs of Small Width
Journal of the ACM | 2019-02-25 | Paper |
Symmetrizing tableaux and the 5th case of the Foulkes conjecture
Journal of Symbolic Computation | 2019-01-21 | Paper |
No occurrence obstructions in geometric complexity theory
Journal of the American Mathematical Society | 2018-10-25 | Paper |
| The complexity of computing Kronecker coefficients | 2018-08-29 | Paper |
| A max-flow algorithm for positivity of Littlewood-Richardson coefficients | 2018-07-23 | Paper |
Polynomials and the exponent of matrix multiplication
Bulletin of the London Mathematical Society | 2018-07-04 | Paper |
On vanishing of Kronecker coefficients
Computational Complexity | 2017-12-18 | Paper |
On the relative power of reduction notions in arithmetic circuit complexity
Information Processing Letters | 2017-11-22 | Paper |
Geometric complexity theory and matrix powering
Differential Geometry and its Applications | 2017-11-21 | Paper |
Rectangular Kronecker coefficients and plethysms in geometric complexity theory
Advances in Mathematics | 2017-09-19 | Paper |
On the complexity of the permanent in various computational models
Journal of Pure and Applied Algebra | 2017-08-08 | Paper |
Fundamental invariants of orbit closures
Journal of Algebra | 2017-03-16 | Paper |
Permanent versus determinant: not via saturations
Proceedings of the American Mathematical Society | 2016-12-29 | Paper |
Small Littlewood-Richardson coefficients
Journal of Algebraic Combinatorics | 2016-08-12 | Paper |
Erratum to: ``Small Littlewood-Richardson coefficients''
Journal of Algebraic Combinatorics | 2016-08-12 | Paper |
Complexity of linear circuits and geometry
Foundations of Computational Mathematics | 2016-06-29 | Paper |
Binary determinantal complexity
Linear Algebra and its Applications | 2016-05-20 | Paper |
16,051 formulas for Ottaviani's invariant of cubic threefolds
Journal of Algebra | 2015-12-07 | Paper |
| On McKay's propagation theorem for the Foulkes conjecture | 2015-09-16 | Paper |
The Saxl conjecture and the dominance order
Discrete Mathematics | 2015-06-29 | Paper |
Explicit lower bounds via geometric complexity theory
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Geometric complexity theory and tensor rank
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Equations for lower bounds on border rank
Experimental Mathematics | 2014-05-13 | Paper |
Deciding positivity of Littlewood-Richardson coefficients
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Nonvanishing of Kronecker coefficients for rectangular shapes.
Advances in Mathematics | 2011-07-07 | Paper |
Even partitions in plethysms.
Journal of Algebra | 2011-05-16 | Paper |
Fixed-parameter debordering of Waring rank
(available as arXiv preprint) | N/A | Paper |
