Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 17.


Bläser, Markus, Ikenmeyer, Christian, Mahajan, Meena, Pandey, Anurag and Saurabh, Nitin
(2020) Algebraic Branching Programs, Border Complexity, and Tangent Spaces. In: 35th Computational Complexity Conference (CCC 2020).


Bläser, Markus, Ikenmeyer, Christian, Mahajan, Meena, Pandey, Anurag and Saurabh, Nitin
(2020) Algebraic Branching Programs, Border Complexity, and Tangent Spaces. Electronic Colloquium on Computational Complexity (ECCC), 18 (39).


Fischer, Nick and Ikenmeyer, Christian
(2020) The Computational Complexity of Plethysm Coefficients. COMPUTATIONAL COMPLEXITY, 29 (2).


Fischer, Nick and Ikenmeyer, Christian
(2020) The Computational Complexity of Plethysm Coefficients. Comput. Complex., 29. 8 - 8.


Breiding, Paul, Ikenmeyer, Christian, Michałek, Mateusz and Hodges, Reuven
(2021) Equations for GL invariant families of polynomials.


Blaeser, Markus, Ikenmeyer, Christian, Jindal, Gorav and Lysikov, Vladimir
(2018) Generalized Matrix Completion and Algebraic Natural Proofs. In: STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing.


Ikenmeyer, Christian and Kandasamy, Umangathan
(2020) Implementing Geometric Complexity Theory: On the Separation of Orbit Closures via Symmetries. PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20). 713 - 726.


Ikenmeyer, Christian, Komarath, Balagopal and Saurabh, Nitin
(2021) Karchmer-Wigderson Games for Hazard-free Computation. [Preprint]


Ikenmeyer, Christian, Komarath, Balagopal and Saurabh, Nitin
(2021) Karchmer-Wigderson Games for Hazard-free Computation. Electron. Colloquium Comput. Complex., 28. 100 - 100.


Buergisser, Peter, Ikenmeyer, Christian and Panova, Greta
(2019) No occurrence obstructions in geometric complexity theory. JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 32 (1). 163 - 193.


Bläser, Markus, Dörfler, Julian and Ikenmeyer, Christian
(2021) On the Complexity of Evaluating Highest Weight Vectors. .


Ikenmeyer, Christian, Komarath, Balagopal, Lenzen, Christoph, Lysikov, Vladimir, Mokhov, Andrey and Sreenivasaiah, Karteek
(2019) On the Complexity of Hazard-free Circuits. JOURNAL OF THE ACM, 66 (4).


Bläser, Markus, Dörfler, Julian and Ikenmeyer, Christian
(2020) On the complexity of evaluating highest weight vectors. [Preprint]


Bläser, Markus, Ikenmeyer, Christian, Lysikov, Vladimir, Pandey, Anurag and Schreyer, Frank-Olaf
(2019) Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory.


Haas, Lennart J and Ikenmeyer, Christian
(2021) Young Flattenings in the Schur module basis. [Preprint]


Ballard, Grey, Ikenmeyer, Christian, Landsberg, JM and Ryder, Nick
(2019) The geometry of rank decompositions of matrix multiplication II: 3 x 3 matrices. JOURNAL OF PURE AND APPLIED ALGEBRA, 223 (8). 3205 - 3224.


Ikenmeyer, Christian and Sanyal, Abhiroop
(2022) A note on VNP-completeness and border complexity. INFORMATION PROCESSING LETTERS, 176.

This list was generated on Sun Sep 18 07:57:42 2022 BST.