( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Power of Border Width-2 ABPs over Fields of Characteristic 2.

, , , , , и . STACS, том 289 из LIPIcs, стр. 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Christian Ikenmeyer

Kurt Ikenmeyer

Christian Christian

Christian Schüller

Automatisierte Feedbackgenerierung in der benutzerzentrierten Softwareentwicklung am Beispiel mobiler Anwendungen. TU München, (2009)

Christian Winter

Gold-katalysierte Cycloisomerisierung funktionalisierter Allene und Anwendung in der Naturstoffsynthese. TU Dortmund, (2009)
 

Другие публикации лиц с тем же именем

No Occurrence Obstructions in Geometric Complexity Theory., , и . FOCS, стр. 386-395. IEEE Computer Society, (2016)Homogeneous Algebraic Complexity Theory and Algebraic Formulas., , , , и . CoRR, (2023)On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions., , и . ICALP, том 132 из LIPIcs, стр. 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The geometry of rank decompositions of matrix multiplication II: 3×3 matrices., , , и . CoRR, (2018)Rectangular Kronecker coefficients and plethysms in geometric complexity theory., и . CoRR, (2015)The Computational Complexity of Plethysm Coefficients., и . CoRR, (2020)Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings., , , , , и . CCC, том 169 из LIPIcs, стр. 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Orbit Closure Containment Problem and Slice Rank of Tensors., , , , и . SODA, стр. 2565-2584. SIAM, (2021)Positivity of the symmetric group characters is as hard as the polynomial time hierarchy., , и . SODA, стр. 3573-3586. SIAM, (2023)Border complexity via elementary symmetric polynomials., , , , и . Electron. Colloquium Comput. Complex., (2022)