default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Ikenmeyer
Person information
- affiliation: University of Warwick, Department of Mathematics, Coventry, UK
- affiliation (former): University of Liverpool, Department of Computer Science, UK
- affiliation (former): Max Planck Institute for Software Systems, Saarbrücken, Germany
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (former): Texas A&M University, College Station, TX, USA
- affiliation (former, PhD 2012): University of Paderborn, Institute of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Christian Ikenmeyer, Dylan Khangure:
Advanced Spikes 'n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable. FUN 2024: 18:1-18:13- [c21]Julian Dörfler, Christian Ikenmeyer:
Functional Closure Properties of Finite ℕ-Weighted Automata. ICALP 2024: 134:1-134:18 - [c20]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
:
Homogeneous Algebraic Complexity Theory and Algebraic Formulas. ITCS 2024: 43:1-43:23 - [c19]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Fixed-Parameter Debordering of Waring Rank. STACS 2024: 30:1-30:15 - [c18]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: 31:1-31:16 - [i41]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Fixed-parameter debordering of Waring rank. CoRR abs/2401.07631 (2024) - [i40]Julian Dörfler, Christian Ikenmeyer:
Functional Closure Properties of Finite ℕ-weighted Automata. CoRR abs/2404.14245 (2024) - 2023
- [c17]Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh:
Karchmer-Wigderson Games for Hazard-Free Computation. ITCS 2023: 74:1-74:25 - [c16]Christian Ikenmeyer, Igor Pak, Greta Panova:
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. SODA 2023: 3573-3586 - [i39]Christian Ikenmeyer, Greta Panova:
All Kronecker coefficients are reduced Kronecker coefficients. CoRR abs/2305.03003 (2023) - [i38]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Homogeneous Algebraic Complexity Theory and Algebraic Formulas. CoRR abs/2311.17019 (2023) - 2022
- [j13]Christian Ikenmeyer, Abhiroop Sanyal:
A note on VNP-completeness and border complexity. Inf. Process. Lett. 176: 106243 (2022) - [c15]Christian Ikenmeyer, Igor Pak:
What is in #P and what is not? FOCS 2022: 860-871 - [c14]Fulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, Vladimir Lysikov:
Degree-Restricted Strength Decompositions and Algebraic Branching Programs. FSTTCS 2022: 20:1-20:15 - [i37]Christian Ikenmeyer, Igor Pak:
What is in #P and what is not? CoRR abs/2204.13149 (2022) - [i36]Purnata Ghosal, Fulvio Gesmundo, Christian Ikenmeyer, Vladimir Lysikov:
Degree-restricted strength decompositions and algebraic branching programs. CoRR abs/2205.02149 (2022) - [i35]Christian Ikenmeyer, Igor Pak, Greta Panova:
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. CoRR abs/2207.05423 (2022) - [i34]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Border complexity via elementary symmetric polynomials. CoRR abs/2211.07055 (2022) - [i33]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Border complexity via elementary symmetric polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c13]Markus Bläser, Julian Dörfler, Christian Ikenmeyer:
On the Complexity of Evaluating Highest Weight Vectors. CCC 2021: 29:1-29:36 - [c12]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: 2565-2584 - [i32]Christian Ikenmeyer, Abhiroop Sanyal:
A note on VNP-completeness and border complexity. CoRR abs/2102.07173 (2021) - [i31]Lennart J. Haas, Christian Ikenmeyer:
Young Flattenings in the Schur module basis. CoRR abs/2104.02363 (2021) - [i30]Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh:
Karchmer-Wigderson Games for Hazard-free Computation. CoRR abs/2107.05128 (2021) - [i29]Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh:
Karchmer-Wigderson Games for Hazard-free Computation. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j12]Nick Fischer, Christian Ikenmeyer:
The Computational Complexity of Plethysm Coefficients. Comput. Complex. 29(2): 8 (2020) - [j11]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): 354-376 (2020) - [c11]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. CCC 2020: 12:1-12:17 - [c10]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CCC 2020: 21:1-21:24 - [c9]Christian Ikenmeyer, Umangathan Kandasamy:
Implementing geometric complexity theory: on the separation of orbit closures via symmetries. STOC 2020: 713-726 - [i28]Nick Fischer, Christian Ikenmeyer:
The Computational Complexity of Plethysm Coefficients. CoRR abs/2002.00788 (2020) - [i27]Markus Bläser, Julian Dörfler, Christian Ikenmeyer:
On the complexity of evaluating highest weight vectors. CoRR abs/2002.11594 (2020) - [i26]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. CoRR abs/2003.04834 (2020) - [i25]Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh:
Algebraic Branching Programs, Border Complexity, and Tangent Spaces. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j10]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): 322-327 (2019) - [j9]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the Complexity of Hazard-free Circuits. J. ACM 66(4): 25:1-25:20 (2019) - [c8]Julian Dörfler, Christian Ikenmeyer, Greta Panova:
On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. ICALP 2019: 51:1-51:14 - [i24]Julian Dörfler, Christian Ikenmeyer, Greta Panova:
On geometric complexity theory: Multiplicity obstructions are stronger than occurrence obstructions. CoRR abs/1901.04576 (2019) - [i23]Markus Bläser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer:
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory. CoRR abs/1911.02534 (2019) - [i22]Christian Ikenmeyer, Umangathan Kandasamy:
Implementing geometric complexity theory: On the separation of orbit closures via symmetries. CoRR abs/1911.03990 (2019) - [i21]Christian Ikenmeyer, Michael Walter:
Hyperpfaffians and Geometric Complexity Theory. CoRR abs/1912.09389 (2019) - 2018
- [j8]Christian Ikenmeyer, Stefan Mengel:
On the relative power of reduction notions in arithmetic circuit complexity. Inf. Process. Lett. 130: 7-10 (2018) - [j7]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On Algebraic Branching Programs of Small Width. J. ACM 65(5): 32:1-32:29 (2018) - [c7]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the complexity of hazard-free circuits. STOC 2018: 878-889 - [c6]Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Generalized matrix completion and algebraic natural proofs. STOC 2018: 1193-1206 - [i20]Grey Ballard, Christian Ikenmeyer, J. M. Landsberg, Nick Ryder:
The geometry of rank decompositions of matrix multiplication II: 3×3 matrices. CoRR abs/1801.00843 (2018) - [i19]Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Generalized Matrix Completion and Algebraic Natural Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j6]Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter:
On vanishing of Kronecker coefficients. Comput. Complex. 26(4): 949-992 (2017) - [j5]Man Wai Cheung, Christian Ikenmeyer, Sevak Mkrtchyan:
Symmetrizing tableaux and the 5th case of the Foulkes conjecture. J. Symb. Comput. 80: 833-843 (2017) - [c5]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On Algebraic Branching Programs of Small Width. CCC 2017: 20:1-20:31 - [i18]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On algebraic branching programs of small width. CoRR abs/1702.05328 (2017) - [i17]Christian Ikenmeyer, Vladimir Lysikov:
Strassen's 2x2 matrix multiplication algorithm: A conceptual perspective. CoRR abs/1708.08083 (2017) - [i16]Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah:
On the complexity of hazard-free circuits. CoRR abs/1711.01904 (2017) - [i15]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On algebraic branching programs of small width. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j4]Fulvio Gesmundo, Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg:
Complexity of Linear Circuits and Geometry. Found. Comput. Math. 16(3): 599-635 (2016) - [c4]Peter Bürgisser, Christian Ikenmeyer, Greta Panova:
No Occurrence Obstructions in Geometric Complexity Theory. FOCS 2016: 386-395 - [c3]Christian Ikenmeyer, Greta Panova:
Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory. FOCS 2016: 396-405 - [i14]Peter Bürgisser, Christian Ikenmeyer, Greta Panova:
No occurrence obstructions in geometric complexity theory. CoRR abs/1604.06431 (2016) - [i13]Christian Ikenmeyer, Stefan Mengel:
On the relative power of reduction notions in arithmetic circuit complexity. CoRR abs/1609.05942 (2016) - [i12]Christian Ikenmeyer, J. M. Landsberg:
On the complexity of the permanent in various computational models. CoRR abs/1610.00159 (2016) - [i11]Luca Chiantini, Christian Ikenmeyer, J. M. Landsberg, Giorgio Ottaviani:
The geometry of rank decompositions of matrix multiplication I: 2x2 matrices. CoRR abs/1610.08364 (2016) - [i10]Fulvio Gesmundo, Christian Ikenmeyer, Greta Panova:
Geometric complexity theory and matrix powering. CoRR abs/1611.00827 (2016) - 2015
- [j3]Christian Ikenmeyer:
The Saxl conjecture and the dominance order. Discret. Math. 338(11): 1970-1975 (2015) - [i9]Peter Bürgisser, Christian Ikenmeyer, Jesko Hüttenhain:
Permanent versus determinant: not via saturations of monoids of representations. CoRR abs/1501.05528 (2015) - [i8]Christian Ikenmeyer, Ketan D. Mulmuley, Michael Walter:
On vanishing of Kronecker coefficients. CoRR abs/1507.02955 (2015) - [i7]Peter Bürgisser, Christian Ikenmeyer:
Fundamental invariants of orbit closures. CoRR abs/1511.02927 (2015) - [i6]Christian Ikenmeyer, Greta Panova:
Rectangular Kronecker coefficients and plethysms in geometric complexity theory. CoRR abs/1512.03798 (2015) - 2014
- [i5]Jesko Hüttenhain, Christian Ikenmeyer:
Binary Determinantal Complexity. CoRR abs/1410.8202 (2014) - 2013
- [j2]Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg:
Equations for Lower Bounds on Border Rank. Exp. Math. 22(4): 372-383 (2013) - [j1]Peter Bürgisser, Christian Ikenmeyer:
Deciding Positivity of Littlewood-Richardson Coefficients. SIAM J. Discret. Math. 27(4): 1639-1681 (2013) - [c2]Peter Bürgisser, Christian Ikenmeyer:
Explicit lower bounds via geometric complexity theory. STOC 2013: 141-150 - [i4]Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg:
Computer aided methods for lower bounds on the border rank. CoRR abs/1305.0779 (2013) - [i3]Fulvio Gesmundo, Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg:
Complexity of linear circuits and geometry. CoRR abs/1310.1362 (2013) - 2012
- [i2]Peter Bürgisser, Christian Ikenmeyer:
Explicit Lower Bounds via Geometric Complexity Theory. CoRR abs/1210.8368 (2012) - 2011
- [c1]Peter Bürgisser, Christian Ikenmeyer:
Geometric complexity theory and tensor rank. STOC 2011: 509-518 - 2010
- [i1]Peter Bürgisser, Christian Ikenmeyer:
Geometric Complexity Theory and Tensor Rank. CoRR abs/1011.1350 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
