Christian Ikenmeyer

84 papers A* 12A 9B 1Misc 1Journal 60Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Geometric complexity theory for product-plus-power.
J. Symb. Comput.
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2025 A conf
Algebraic Metacomplexity and Representation Theory.
CCC
Maxim van den Berg, Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Vladimir Lysikov
2025 J jnl
Kronecker Coefficients in #BQP.
ACM Trans. Quantum Comput.
Christian Ikenmeyer, Sathyawageeswar Subramanian
2025 J jnl
On the gradient of the coefficient of the characteristic polynomial.
CoRR
Christian Ikenmeyer
2025 J jnl
Strassen's algorithm via orbit flip graphs.
CoRR
Christian Ikenmeyer, Jakob Moosbauer
2025 B conf
Which Graph Motif Parameters Count?
MFCS
Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer
2025 J jnl
Which graph motif parameters count?
CoRR
Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer
2024 Misc conf
Advanced Spikes 'n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable.
FUN
Christian Ikenmeyer, Dylan Khangure
2024 J jnl
Algebraic metacomplexity and representation theory.
CoRR
Maxim van den Berg, Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Vladimir Lysikov
2024 A conf
Fixed-Parameter Debordering of Waring Rank.
STACS
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2024 J jnl
Fixed-parameter debordering of Waring rank.
CoRR
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2024 A* conf
Functional Closure Properties of Finite ℕ-Weighted Automata.
ICALP
Julian Dörfler, Christian Ikenmeyer
2024 J jnl
Functional Closure Properties of Finite ℕ-weighted Automata.
CoRR
Julian Dörfler, Christian Ikenmeyer
2024 A conf
Homogeneous Algebraic Complexity Theory and Algebraic Formulas.
ITCS
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2024 A conf
On the Power of Border Width-2 ABPs over Fields of Characteristic 2.
STACS
Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar
2023 J jnl
All Kronecker coefficients are reduced Kronecker coefficients.
CoRR
Christian Ikenmeyer, Greta Panova
2023 J jnl
Homogeneous Algebraic Complexity Theory and Algebraic Formulas.
CoRR
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2023 A conf
Karchmer-Wigderson Games for Hazard-Free Computation.
ITCS
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
2023 A* conf
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy.
SODA
Christian Ikenmeyer, Igor Pak, Greta Panova
2022 J jnl
A note on VNP-completeness and border complexity.
Inf. Process. Lett.
Christian Ikenmeyer, Abhiroop Sanyal
2022 J jnl
Border complexity via elementary symmetric polynomials.
CoRR
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2022 J jnl
Border complexity via elementary symmetric polynomials.
Electron. Colloquium Comput. Complex.
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2022 — conf
Degree-Restricted Strength Decompositions and Algebraic Branching Programs.
FSTTCS
Fulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, Vladimir Lysikov
2022 J jnl
Degree-restricted strength decompositions and algebraic branching programs.
CoRR
Purnata Ghosal, Fulvio Gesmundo, Christian Ikenmeyer, Vladimir Lysikov
2022 J jnl
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy.
CoRR
Christian Ikenmeyer, Igor Pak, Greta Panova
2022 A* conf
What is in #P and what is not?
FOCS
Christian Ikenmeyer, Igor Pak
2022 J jnl
What is in #P and what is not?
CoRR
Christian Ikenmeyer, Igor Pak
2021 J jnl
A note on VNP-completeness and border complexity.
CoRR
Christian Ikenmeyer, Abhiroop Sanyal
2021 J jnl
Karchmer-Wigderson Games for Hazard-free Computation.
CoRR
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
2021 J jnl
Karchmer-Wigderson Games for Hazard-free Computation.
Electron. Colloquium Comput. Complex.
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
2021 A conf
On the Complexity of Evaluating Highest Weight Vectors.
CCC
Markus Bläser, Julian Dörfler, Christian Ikenmeyer
2021 A* conf
On the Orbit Closure Containment Problem and Slice Rank of Tensors.
SODA
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer
2021 J jnl
Young Flattenings in the Schur module basis.
CoRR
Lennart J. Haas, Christian Ikenmeyer
2020 A conf
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
CCC
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
2020 J jnl
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
CoRR
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
2020 J jnl
Algebraic Branching Programs, Border Complexity, and Tangent Spaces.
Electron. Colloquium Comput. Complex.
Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh
2020 A* conf
Implementing geometric complexity theory: on the separation of orbit closures via symmetries.
STOC
Christian Ikenmeyer, Umangathan Kandasamy
2020 J jnl
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions.
SIAM J. Appl. Algebra Geom.
Julian Dörfler, Christian Ikenmeyer, Greta Panova
2020 J jnl
On the complexity of evaluating highest weight vectors.
CoRR
Markus Bläser, Julian Dörfler, Christian Ikenmeyer
2020 A conf
Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings.
CCC
Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson
2020 J jnl
The Computational Complexity of Plethysm Coefficients.
Comput. Complex.
Nick Fischer, Christian Ikenmeyer
2020 J jnl
The Computational Complexity of Plethysm Coefficients.
CoRR
Nick Fischer, Christian Ikenmeyer
2019 J jnl
Hyperpfaffians and Geometric Complexity Theory.
CoRR
Christian Ikenmeyer, Michael Walter
2019 J jnl
Implementing geometric complexity theory: On the separation of orbit closures via symmetries.
CoRR
Christian Ikenmeyer, Umangathan Kandasamy
2019 A* conf
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions.
ICALP
Julian Dörfler, Christian Ikenmeyer, Greta Panova
2019 J jnl
On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions.
CoRR
Julian Dörfler, Christian Ikenmeyer, Greta Panova
2019 J jnl
On the Complexity of Hazard-free Circuits.
J. ACM
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2019 J jnl
The Geometry of Rank Decompositions of Matrix Multiplication I: 2 × 2 Matrices.
Exp. Math.
Luca Chiantini, Christian Ikenmeyer, J. M. Landsberg, Giorgio Ottaviani
2019 J jnl
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory.
CoRR
Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer
2018 J jnl
Generalized Matrix Completion and Algebraic Natural Proofs.
Electron. Colloquium Comput. Complex.
Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2018 A* conf
Generalized matrix completion and algebraic natural proofs.
STOC
Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
2018 J jnl
On Algebraic Branching Programs of Small Width.
J. ACM
Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam
2018 A* conf
On the complexity of hazard-free circuits.
STOC
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2018 J jnl
On the relative power of reduction notions in arithmetic circuit complexity.
Inf. Process. Lett.
Christian Ikenmeyer, Stefan Mengel
2018 J jnl
The geometry of rank decompositions of matrix multiplication II: 3×3 matrices.
CoRR
Grey Ballard, Christian Ikenmeyer, J. M. Landsberg, Nick Ryder
2017 A conf
On Algebraic Branching Programs of Small Width.
CCC
Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam
2017 J jnl
On algebraic branching programs of small width.
CoRR
Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam
2017 J jnl
On algebraic branching programs of small width.
Electron. Colloquium Comput. Complex.
Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam
2017 J jnl
On the complexity of hazard-free circuits.
CoRR
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2017 J jnl
On vanishing of Kronecker coefficients.
Comput. Complex.
Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter
2017 J jnl
Strassen's 2x2 matrix multiplication algorithm: A conceptual perspective.
CoRR
Christian Ikenmeyer, Vladimir Lysikov
2017 J jnl
Symmetrizing tableaux and the 5th case of the Foulkes conjecture.
J. Symb. Comput.
Man Wai Cheung, Christian Ikenmeyer, Sevak Mkrtchyan
2016 J jnl
Complexity of Linear Circuits and Geometry.
Found. Comput. Math.
Fulvio Gesmundo, Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg
2016 J jnl
Geometric complexity theory and matrix powering.
CoRR
Fulvio Gesmundo, Christian Ikenmeyer, Greta Panova
2016 A* conf
No Occurrence Obstructions in Geometric Complexity Theory.
FOCS
Peter Bürgisser, Christian Ikenmeyer, Greta Panova
2016 J jnl
No occurrence obstructions in geometric complexity theory.
CoRR
Peter Bürgisser, Christian Ikenmeyer, Greta Panova
2016 J jnl
On the complexity of the permanent in various computational models.
CoRR
Christian Ikenmeyer, J. M. Landsberg
2016 J jnl
On the relative power of reduction notions in arithmetic circuit complexity.
CoRR
Christian Ikenmeyer, Stefan Mengel
2016 A* conf
Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory.
FOCS
Christian Ikenmeyer, Greta Panova
2016 J jnl
The geometry of rank decompositions of matrix multiplication I: 2x2 matrices.
CoRR
Luca Chiantini, Christian Ikenmeyer, J. M. Landsberg, Giorgio Ottaviani
2015 J jnl
Fundamental invariants of orbit closures.
CoRR
Peter Bürgisser, Christian Ikenmeyer
2015 J jnl
On vanishing of Kronecker coefficients.
CoRR
Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter
2015 J jnl
Permanent versus determinant: not via saturations of monoids of representations.
CoRR
Peter Bürgisser, Christian Ikenmeyer, Jesko Hüttenhain
2015 J jnl
Rectangular Kronecker coefficients and plethysms in geometric complexity theory.
CoRR
Christian Ikenmeyer, Greta Panova
2015 J jnl
The Saxl conjecture and the dominance order.
Discret. Math.
Christian Ikenmeyer
2014 J jnl
Binary Determinantal Complexity.
CoRR
Jesko Hüttenhain, Christian Ikenmeyer
2013 J jnl
Complexity of linear circuits and geometry.
CoRR
Fulvio Gesmundo, Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg
2013 J jnl
Computer aided methods for lower bounds on the border rank
CoRR
Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg
2013 J jnl
Deciding Positivity of Littlewood-Richardson Coefficients.
SIAM J. Discret. Math.
Peter Bürgisser, Christian Ikenmeyer
2013 J jnl
Equations for Lower Bounds on Border Rank.
Exp. Math.
Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg
2013 A* conf
Explicit lower bounds via geometric complexity theory.
STOC
Peter Bürgisser, Christian Ikenmeyer
2012 J jnl
Explicit Lower Bounds via Geometric Complexity Theory
CoRR
Peter Bürgisser, Christian Ikenmeyer
2011 A* conf
Geometric complexity theory and tensor rank.
STOC
Peter Bürgisser, Christian Ikenmeyer
2010 J jnl
Geometric Complexity Theory and Tensor Rank
CoRR
Peter Bürgisser, Christian Ikenmeyer