Christian Ikenmeyer

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 62

Top Topics

Matrix Multiplication

Search Problems

Complexity Theory

Top Venues

Electron. Colloquium Comput. Complex.

Computational Complexity Conference

Publications

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