Christian Ikenmeyer

CoRR, 2023

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy.

[BibT_eX]

[DOI]

Igor Pak

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

A note on VNP-completeness and border complexity.

[BibT_eX]

[DOI]

Abhiroop Sanyal

Inf. Process. Lett., 2022

Border complexity via elementary symmetric polynomials.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

Degree-Restricted Strength Decompositions and Algebraic Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

What is in #P and what is not?

[BibT_eX]

[DOI]

Igor Pak

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Karchmer-Wigderson Games for Hazard-free Computation.

[BibT_eX]

[DOI]

Balagopal Komarath

Nitin Saurabh

Electron. Colloquium Comput. Complex., 2021

Young Flattenings in the Schur module basis.

[BibT_eX]

[DOI]

Lennart J. Haas

CoRR, 2021

On the Orbit Closure Containment Problem and Slice Rank of Tensors.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

On the Complexity of Evaluating Highest Weight Vectors.

[BibT_eX]

[DOI]

Markus Bläser

Julian Dörfler

Proceedings of the 36th Computational Complexity Conference, 2021

2020

On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions.

[BibT_eX]

[DOI]

Julian Dörfler

SIAM J. Appl. Algebra Geom., 2020

Algebraic Branching Programs, Border Complexity, and Tangent Spaces.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

The Computational Complexity of Plethysm Coefficients.

[BibT_eX]

[DOI]

Nick Fischer

Comput. Complex., 2020

Implementing geometric complexity theory: on the separation of orbit closures via symmetries.

[BibT_eX]

[DOI]

Umangathan Kandasamy

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings.

[BibT_eX]

[DOI]

Ankit Garg

Rafael Mendes de Oliveira

Visu Makam

Michael Walter

Avi Wigderson

Proceedings of the 35th Computational Complexity Conference, 2020

2019

On the Complexity of Hazard-free Circuits.

[BibT_eX]

[DOI]

Karteek Sreenivasaiah

J. ACM, 2019

The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices.

[BibT_eX]

[DOI]

Exp. Math., 2019

Hyperpfaffians and Geometric Complexity Theory.

[BibT_eX]

[DOI]

Michael Walter

CoRR, 2019

Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory.

[BibT_eX]

[DOI]

CoRR, 2019

2018

On Algebraic Branching Programs of Small Width.

[BibT_eX]

[DOI]

Karl Bringmann

Jeroen Zuiddam

J. ACM, 2018

On the relative power of reduction notions in arithmetic circuit complexity.

[BibT_eX]

[DOI]

Stefan Mengel

Inf. Process. Lett., 2018

Generalized Matrix Completion and Algebraic Natural Proofs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

The geometry of rank decompositions of matrix multiplication II: 3×3 matrices.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Symmetrizing tableaux and the 5th case of the Foulkes conjecture.

[BibT_eX]

[DOI]

Man Wai Cheung

Sevak Mkrtchyan

J. Symb. Comput., 2017

Strassen's 2x2 matrix multiplication algorithm: A conceptual perspective.

[BibT_eX]

[DOI]

Vladimir Lysikov

CoRR, 2017

On vanishing of Kronecker coefficients.

[BibT_eX]

[DOI]

Ketan D. Mulmuley

Michael Walter

Comput. Complex., 2017

2016

Complexity of Linear Circuits and Geometry.

[BibT_eX]

[DOI]

Fulvio Gesmundo

Jonathan D. Hauenstein

Found. Comput. Math., 2016

On the complexity of the permanent in various computational models.

[BibT_eX]

[DOI]

CoRR, 2016

Geometric complexity theory and matrix powering.

[BibT_eX]

[DOI]

Fulvio Gesmundo

CoRR, 2016

The geometry of rank decompositions of matrix multiplication I: 2x2 matrices.

[BibT_eX]

[DOI]

CoRR, 2016

Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

No Occurrence Obstructions in Geometric Complexity Theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

The Saxl conjecture and the dominance order.

[BibT_eX]

[DOI]

Discret. Math., 2015

Permanent versus determinant: not via saturations of monoids of representations.

[BibT_eX]

[DOI]

Jesko Hüttenhain

CoRR, 2015

Fundamental invariants of orbit closures.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Binary Determinantal Complexity.

[BibT_eX]

[DOI]

Jesko Hüttenhain

CoRR, 2014

2013

Deciding Positivity of Littlewood-Richardson Coefficients.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Equations for Lower Bounds on Border Rank.

[BibT_eX]

[DOI]

Jonathan D. Hauenstein

Exp. Math., 2013

Computer aided methods for lower bounds on the border rank

[BibT_eX]

[DOI]

Jonathan D. Hauenstein

CoRR, 2013

Explicit lower bounds via geometric complexity theory.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

2011

Geometric complexity theory and tensor rank.

[BibT_eX]

[DOI]