direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Ehemalige Mitarbeiter

Dr. Christian Ikenmeyer

Lupe [1]

Kontakt
University of Liverpool
Department of Computer Science
Ashton Building, Office 311
Ashton Street, Liverpool, L69 3BX
United Kingdom
 
Persönliche Homepage
http://pcwww.liv.ac.uk/~iken/ [2]

Publikationen in der Arbeitsgruppe

vor >> [4]

Peter Bürgisser and Christian Ikenmeyer and Greta Panova (2019). No occurence obstructions in geometric complexity theory [5]. Journal of the American Mathematical Society, 163–193.


Peter Bürgisser and Christian Ikenmeyer (2017). Fundamental invariants of orbit closures [6]. Journal of Algebra, 390–434.


Peter Bürgisser and Christian Ikenmeyer and Jesko Hüttenhain (2016). Permanent Versus Determinant: Not Via Saturations [7]. Proc. AMS, 1247-1258.


Jesko Hüttenhain and Christian Ikenmeyer (2016). Binary determinantal complexity [8]. Linear Algebra and its Applications, 559 - 573.


Peter Bürgisser and Christian Ikenmeyer and Greta Panova (2016). No occurrence obstructions in geometric complexity theory [9]. Proceedings 57th Annual IEEE Symposium on Foundations of Computer Science, 386–395.


Christian Ikenmeyer (2016). Small Littlewood-Richardson coefficients [10]. Journal of Algebraic Combinatorics, 1–29.


Jonathan David Hauenstein and Christian Ikenmeyer and Joseph Montague Landsberg (2013). Equations for lower bounds on border rank [11]. Experimental Mathematics, 372–383.


Peter Bürgisser and Christian Ikenmeyer (2013). Explicit Lower Bounds via Geometric Complexity Theory [12]. Proceedings 45th ACM Symposium on Theory of Computing, 141-150.


Peter Bürgisser and Christian Ikenmeyer (2013). Deciding Positivity of Littlewood-Richardson coefficients [13]. SIAM J. Discrete Math., 1639-1681.


Christian Ikenmeyer (2012). Geometric Complexity Theory, Tensor Rank, and Littlewood-Richardson Coefficients [14]. Universität Paderborn


Peter Bürgisser and Christian Ikenmeyer (2011). Geometric Complexity Theory and Tensor Rank [15]. Proceedings 43rd Annual ACM Symposium on Theory of Computing 2011, 509-518.


Peter Bürgisser and Matthias Christandl and Christian Ikenmeyer (2011). Even partitions in plethysms [16]. Journal of Algebra, 322-329.


Peter Bürgisser and Matthias Christandl and Christian Ikenmeyer (2011). Nonvanishing of Kronecker coefficients for rectangular shapes [17]. Advances in Mathematics, 2082-2091.


Peter Bürgisser and Christian Ikenmeyer (2009). A max-flow algorithm for positivity of Littlewood-Richardson coefficients [18]. FPSAC 2009, 267-278.


Peter Bürgisser and Christian Ikenmeyer (2008). The Complexity of Computing Kronecker Coefficients [19]. FPSAC 2008, 357-368.


vor >> [21]
------ Links: ------

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008