Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Christian Ikenmeyer
@inproceedings{DBLP:conf/innovations/DuttaGIJL24,
author = {Pranjal Dutta and
Fulvio Gesmundo and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
editor = {Venkatesan Guruswami},
title = {Homogeneous Algebraic Complexity Theory and Algebraic Formulas},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {43:1--43:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.43},
doi = {10.4230/LIPICS.ITCS.2024.43},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/DuttaGIJL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DuttaGIJL24,
author = {Pranjal Dutta and
Fulvio Gesmundo and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
editor = {Olaf Beyersdorff and
Mamadou Moustapha Kant{\'{e}} and
Orna Kupferman and
Daniel Lokshtanov},
title = {Fixed-Parameter Debordering of Waring Rank},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
series = {LIPIcs},
volume = {289},
pages = {30:1--30:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.STACS.2024.30},
doi = {10.4230/LIPICS.STACS.2024.30},
timestamp = {Mon, 11 Mar 2024 15:43:27 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DuttaGIJL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DuttaIKMNT24,
author = {Pranjal Dutta and
Christian Ikenmeyer and
Balagopal Komarath and
Harshil Mittal and
Saraswati Girish Nanoti and
Dhara Thakkar},
editor = {Olaf Beyersdorff and
Mamadou Moustapha Kant{\'{e}} and
Orna Kupferman and
Daniel Lokshtanov},
title = {On the Power of Border Width-2 ABPs over Fields of Characteristic
2},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
series = {LIPIcs},
volume = {289},
pages = {31:1--31:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.STACS.2024.31},
doi = {10.4230/LIPICS.STACS.2024.31},
timestamp = {Mon, 11 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DuttaIKMNT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-07631,
author = {Pranjal Dutta and
Fulvio Gesmundo and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
title = {Fixed-parameter debordering of Waring rank},
journal = {CoRR},
volume = {abs/2401.07631},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.07631},
doi = {10.48550/ARXIV.2401.07631},
eprinttype = {arXiv},
eprint = {2401.07631},
timestamp = {Thu, 01 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-07631.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/IkenmeyerKS23,
author = {Christian Ikenmeyer and
Balagopal Komarath and
Nitin Saurabh},
editor = {Yael Tauman Kalai},
title = {Karchmer-Wigderson Games for Hazard-Free Computation},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {74:1--74:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.74},
doi = {10.4230/LIPICS.ITCS.2023.74},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/IkenmeyerKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IkenmeyerPP23,
author = {Christian Ikenmeyer and
Igor Pak and
Greta Panova},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Positivity of the symmetric group characters is as hard as the polynomial
time hierarchy},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {3573--3586},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch136},
doi = {10.1137/1.9781611977554.CH136},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/IkenmeyerPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-03003,
author = {Christian Ikenmeyer and
Greta Panova},
title = {All Kronecker coefficients are reduced Kronecker coefficients},
journal = {CoRR},
volume = {abs/2305.03003},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.03003},
doi = {10.48550/ARXIV.2305.03003},
eprinttype = {arXiv},
eprint = {2305.03003},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-03003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-17019,
author = {Pranjal Dutta and
Fulvio Gesmundo and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
title = {Homogeneous Algebraic Complexity Theory and Algebraic Formulas},
journal = {CoRR},
volume = {abs/2311.17019},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.17019},
doi = {10.48550/ARXIV.2311.17019},
eprinttype = {arXiv},
eprint = {2311.17019},
timestamp = {Mon, 04 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-17019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IkenmeyerS22,
author = {Christian Ikenmeyer and
Abhiroop Sanyal},
title = {A note on VNP-completeness and border complexity},
journal = {Inf. Process. Lett.},
volume = {176},
pages = {106243},
year = {2022},
url = {https://doi.org/10.1016/j.ipl.2021.106243},
doi = {10.1016/J.IPL.2021.106243},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IkenmeyerS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IkenmeyerP22,
author = {Christian Ikenmeyer and
Igor Pak},
title = {What is in {\#}P and what is not?},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {860--871},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00087},
doi = {10.1109/FOCS54457.2022.00087},
timestamp = {Sat, 31 Dec 2022 17:14:50 +0100},
biburl = {https://dblp.org/rec/conf/focs/IkenmeyerP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GesmundoGIL22,
author = {Fulvio Gesmundo and
Purnata Ghosal and
Christian Ikenmeyer and
Vladimir Lysikov},
editor = {Anuj Dawar and
Venkatesan Guruswami},
title = {Degree-Restricted Strength Decompositions and Algebraic Branching
Programs},
booktitle = {42nd {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2022, December 18-20, 2022,
{IIT} Madras, Chennai, India},
series = {LIPIcs},
volume = {250},
pages = {20:1--20:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2022.20},
doi = {10.4230/LIPICS.FSTTCS.2022.20},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GesmundoGIL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-13149,
author = {Christian Ikenmeyer and
Igor Pak},
title = {What is in {\#}P and what is not?},
journal = {CoRR},
volume = {abs/2204.13149},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.13149},
doi = {10.48550/ARXIV.2204.13149},
eprinttype = {arXiv},
eprint = {2204.13149},
timestamp = {Mon, 02 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-13149.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-02149,
author = {Purnata Ghosal and
Fulvio Gesmundo and
Christian Ikenmeyer and
Vladimir Lysikov},
title = {Degree-restricted strength decompositions and algebraic branching
programs},
journal = {CoRR},
volume = {abs/2205.02149},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.02149},
doi = {10.48550/ARXIV.2205.02149},
eprinttype = {arXiv},
eprint = {2205.02149},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-02149.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-05423,
author = {Christian Ikenmeyer and
Igor Pak and
Greta Panova},
title = {Positivity of the symmetric group characters is as hard as the polynomial
time hierarchy},
journal = {CoRR},
volume = {abs/2207.05423},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.05423},
doi = {10.48550/ARXIV.2207.05423},
eprinttype = {arXiv},
eprint = {2207.05423},
timestamp = {Thu, 14 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-05423.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-07055,
author = {Pranjal Dutta and
Fulvio Gesmundo and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
title = {Border complexity via elementary symmetric polynomials},
journal = {CoRR},
volume = {abs/2211.07055},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.07055},
doi = {10.48550/ARXIV.2211.07055},
eprinttype = {arXiv},
eprint = {2211.07055},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-07055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DuttaGIJL22,
author = {Pranjal Dutta and
Fulvio Gesmundo and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
title = {Border complexity via elementary symmetric polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-157}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/157},
eprinttype = {ECCC},
eprint = {TR22-157},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/DuttaGIJL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaserDI21,
author = {Markus Bl{\"{a}}ser and
Julian D{\"{o}}rfler and
Christian Ikenmeyer},
editor = {Valentine Kabanets},
title = {On the Complexity of Evaluating Highest Weight Vectors},
booktitle = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
2021, Toronto, Ontario, Canada (Virtual Conference)},
series = {LIPIcs},
volume = {200},
pages = {29:1--29:36},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.CCC.2021.29},
doi = {10.4230/LIPICS.CCC.2021.29},
timestamp = {Thu, 02 Feb 2023 13:27:03 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaserDI21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlaserILPS21,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Vladimir Lysikov and
Anurag Pandey and
Frank{-}Olaf Schreyer},
editor = {D{\'{a}}niel Marx},
title = {On the Orbit Closure Containment Problem and Slice Rank of Tensors},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2565--2584},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.152},
doi = {10.1137/1.9781611976465.152},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BlaserILPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-07173,
author = {Christian Ikenmeyer and
Abhiroop Sanyal},
title = {A note on VNP-completeness and border complexity},
journal = {CoRR},
volume = {abs/2102.07173},
year = {2021},
url = {https://arxiv.org/abs/2102.07173},
eprinttype = {arXiv},
eprint = {2102.07173},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-07173.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-02363,
author = {Lennart J. Haas and
Christian Ikenmeyer},
title = {Young Flattenings in the Schur module basis},
journal = {CoRR},
volume = {abs/2104.02363},
year = {2021},
url = {https://arxiv.org/abs/2104.02363},
eprinttype = {arXiv},
eprint = {2104.02363},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-02363.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-05128,
author = {Christian Ikenmeyer and
Balagopal Komarath and
Nitin Saurabh},
title = {Karchmer-Wigderson Games for Hazard-free Computation},
journal = {CoRR},
volume = {abs/2107.05128},
year = {2021},
url = {https://arxiv.org/abs/2107.05128},
eprinttype = {arXiv},
eprint = {2107.05128},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-05128.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/IkenmeyerKS21,
author = {Christian Ikenmeyer and
Balagopal Komarath and
Nitin Saurabh},
title = {Karchmer-Wigderson Games for Hazard-free Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-100}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/100},
eprinttype = {ECCC},
eprint = {TR21-100},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/IkenmeyerKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FischerI20,
author = {Nick Fischer and
Christian Ikenmeyer},
title = {The Computational Complexity of Plethysm Coefficients},
journal = {Comput. Complex.},
volume = {29},
number = {2},
pages = {8},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00198-4},
doi = {10.1007/S00037-020-00198-4},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/FischerI20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siaga/DorflerIP20,
author = {Julian D{\"{o}}rfler and
Christian Ikenmeyer and
Greta Panova},
title = {On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger
Than Occurrence Obstructions},
journal = {{SIAM} J. Appl. Algebra Geom.},
volume = {4},
number = {2},
pages = {354--376},
year = {2020},
url = {https://doi.org/10.1137/19M1287638},
doi = {10.1137/19M1287638},
timestamp = {Fri, 31 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siaga/DorflerIP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GargIMOWW20,
author = {Ankit Garg and
Christian Ikenmeyer and
Visu Makam and
Rafael Mendes de Oliveira and
Michael Walter and
Avi Wigderson},
editor = {Shubhangi Saraf},
title = {Search Problems in Algebraic Complexity, GCT, and Hardness of Generators
for Invariant Rings},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {12:1--12:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.12},
doi = {10.4230/LIPICS.CCC.2020.12},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GargIMOWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BlaserIMPS20,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Meena Mahajan and
Anurag Pandey and
Nitin Saurabh},
editor = {Shubhangi Saraf},
title = {Algebraic Branching Programs, Border Complexity, and Tangent Spaces},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {21:1--21:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.21},
doi = {10.4230/LIPICS.CCC.2020.21},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BlaserIMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IkenmeyerK20,
author = {Christian Ikenmeyer and
Umangathan Kandasamy},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Implementing geometric complexity theory: on the separation of orbit
closures via symmetries},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {713--726},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384257},
doi = {10.1145/3357713.3384257},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/IkenmeyerK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-00788,
author = {Nick Fischer and
Christian Ikenmeyer},
title = {The Computational Complexity of Plethysm Coefficients},
journal = {CoRR},
volume = {abs/2002.00788},
year = {2020},
url = {https://arxiv.org/abs/2002.00788},
eprinttype = {arXiv},
eprint = {2002.00788},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-00788.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-11594,
author = {Markus Bl{\"{a}}ser and
Julian D{\"{o}}rfler and
Christian Ikenmeyer},
title = {On the complexity of evaluating highest weight vectors},
journal = {CoRR},
volume = {abs/2002.11594},
year = {2020},
url = {https://arxiv.org/abs/2002.11594},
eprinttype = {arXiv},
eprint = {2002.11594},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-11594.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-04834,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Meena Mahajan and
Anurag Pandey and
Nitin Saurabh},
title = {Algebraic Branching Programs, Border Complexity, and Tangent Spaces},
journal = {CoRR},
volume = {abs/2003.04834},
year = {2020},
url = {https://arxiv.org/abs/2003.04834},
eprinttype = {arXiv},
eprint = {2003.04834},
timestamp = {Mon, 12 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-04834.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaserIMPS20,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Meena Mahajan and
Anurag Pandey and
Nitin Saurabh},
title = {Algebraic Branching Programs, Border Complexity, and Tangent Spaces},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-031}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/031},
eprinttype = {ECCC},
eprint = {TR20-031},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaserIMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/em/ChiantiniILO19,
author = {Luca Chiantini and
Christian Ikenmeyer and
J. M. Landsberg and
Giorgio Ottaviani},
title = {The Geometry of Rank Decompositions of Matrix Multiplication {I:}
2 {\texttimes} 2 Matrices},
journal = {Exp. Math.},
volume = {28},
number = {3},
pages = {322--327},
year = {2019},
url = {https://doi.org/10.1080/10586458.2017.1403981},
doi = {10.1080/10586458.2017.1403981},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/em/ChiantiniILO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/IkenmeyerKLLMS19,
author = {Christian Ikenmeyer and
Balagopal Komarath and
Christoph Lenzen and
Vladimir Lysikov and
Andrey Mokhov and
Karteek Sreenivasaiah},
title = {On the Complexity of Hazard-free Circuits},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {25:1--25:20},
year = {2019},
url = {https://doi.org/10.1145/3320123},
doi = {10.1145/3320123},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/IkenmeyerKLLMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DorflerIP19,
author = {Julian D{\"{o}}rfler and
Christian Ikenmeyer and
Greta Panova},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger
Than Occurrence Obstructions},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.51},
doi = {10.4230/LIPICS.ICALP.2019.51},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/DorflerIP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-04576,
author = {Julian D{\"{o}}rfler and
Christian Ikenmeyer and
Greta Panova},
title = {On geometric complexity theory: Multiplicity obstructions are stronger
than occurrence obstructions},
journal = {CoRR},
volume = {abs/1901.04576},
year = {2019},
url = {http://arxiv.org/abs/1901.04576},
eprinttype = {arXiv},
eprint = {1901.04576},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-04576.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-02534,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Vladimir Lysikov and
Anurag Pandey and
Frank{-}Olaf Schreyer},
title = {Variety Membership Testing, Algebraic Natural Proofs, and Geometric
Complexity Theory},
journal = {CoRR},
volume = {abs/1911.02534},
year = {2019},
url = {http://arxiv.org/abs/1911.02534},
eprinttype = {arXiv},
eprint = {1911.02534},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-02534.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-03990,
author = {Christian Ikenmeyer and
Umangathan Kandasamy},
title = {Implementing geometric complexity theory: On the separation of orbit
closures via symmetries},
journal = {CoRR},
volume = {abs/1911.03990},
year = {2019},
url = {http://arxiv.org/abs/1911.03990},
eprinttype = {arXiv},
eprint = {1911.03990},
timestamp = {Sun, 01 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-03990.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-09389,
author = {Christian Ikenmeyer and
Michael Walter},
title = {Hyperpfaffians and Geometric Complexity Theory},
journal = {CoRR},
volume = {abs/1912.09389},
year = {2019},
url = {http://arxiv.org/abs/1912.09389},
eprinttype = {arXiv},
eprint = {1912.09389},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-09389.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IkenmeyerM18,
author = {Christian Ikenmeyer and
Stefan Mengel},
title = {On the relative power of reduction notions in arithmetic circuit complexity},
journal = {Inf. Process. Lett.},
volume = {130},
pages = {7--10},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2017.09.009},
doi = {10.1016/J.IPL.2017.09.009},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/IkenmeyerM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BringmannIZ18,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
title = {On Algebraic Branching Programs of Small Width},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {32:1--32:29},
year = {2018},
url = {https://doi.org/10.1145/3209663},
doi = {10.1145/3209663},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BringmannIZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IkenmeyerKLLMS18,
author = {Christian Ikenmeyer and
Balagopal Komarath and
Christoph Lenzen and
Vladimir Lysikov and
Andrey Mokhov and
Karteek Sreenivasaiah},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {On the complexity of hazard-free circuits},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {878--889},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188912},
doi = {10.1145/3188745.3188912},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/IkenmeyerKLLMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlaserIJL18,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Generalized matrix completion and algebraic natural proofs},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {1193--1206},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188832},
doi = {10.1145/3188745.3188832},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlaserIJL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-00843,
author = {Grey Ballard and
Christian Ikenmeyer and
J. M. Landsberg and
Nick Ryder},
title = {The geometry of rank decompositions of matrix multiplication {II:}
3{\texttimes}3 matrices},
journal = {CoRR},
volume = {abs/1801.00843},
year = {2018},
url = {http://arxiv.org/abs/1801.00843},
eprinttype = {arXiv},
eprint = {1801.00843},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-00843.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlaserIJL18,
author = {Markus Bl{\"{a}}ser and
Christian Ikenmeyer and
Gorav Jindal and
Vladimir Lysikov},
title = {Generalized Matrix Completion and Algebraic Natural Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-064}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/064},
eprinttype = {ECCC},
eprint = {TR18-064},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlaserIJL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/IkenmeyerMW17,
author = {Christian Ikenmeyer and
Ketan D. Mulmuley and
Michael Walter},
title = {On vanishing of Kronecker coefficients},
journal = {Comput. Complex.},
volume = {26},
number = {4},
pages = {949--992},
year = {2017},
url = {https://doi.org/10.1007/s00037-017-0158-y},
doi = {10.1007/S00037-017-0158-Y},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/IkenmeyerMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/CheungIM17,
author = {Man Wai Cheung and
Christian Ikenmeyer and
Sevak Mkrtchyan},
title = {Symmetrizing tableaux and the 5th case of the Foulkes conjecture},
journal = {J. Symb. Comput.},
volume = {80},
pages = {833--843},
year = {2017},
url = {https://doi.org/10.1016/j.jsc.2016.09.002},
doi = {10.1016/J.JSC.2016.09.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/CheungIM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BringmannIZ17,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
editor = {Ryan O'Donnell},
title = {On Algebraic Branching Programs of Small Width},
booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
Riga, Latvia},
series = {LIPIcs},
volume = {79},
pages = {20:1--20:31},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CCC.2017.20},
doi = {10.4230/LIPICS.CCC.2017.20},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/BringmannIZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannIZ17,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
title = {On algebraic branching programs of small width},
journal = {CoRR},
volume = {abs/1702.05328},
year = {2017},
url = {http://arxiv.org/abs/1702.05328},
eprinttype = {arXiv},
eprint = {1702.05328},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannIZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-08083,
author = {Christian Ikenmeyer and
Vladimir Lysikov},
title = {Strassen's 2x2 matrix multiplication algorithm: {A} conceptual perspective},
journal = {CoRR},
volume = {abs/1708.08083},
year = {2017},
url = {http://arxiv.org/abs/1708.08083},
eprinttype = {arXiv},
eprint = {1708.08083},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-08083.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-01904,
author = {Christian Ikenmeyer and
Balagopal Komarath and
Christoph Lenzen and
Vladimir Lysikov and
Andrey Mokhov and
Karteek Sreenivasaiah},
title = {On the complexity of hazard-free circuits},
journal = {CoRR},
volume = {abs/1711.01904},
year = {2017},
url = {http://arxiv.org/abs/1711.01904},
eprinttype = {arXiv},
eprint = {1711.01904},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-01904.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BringmannIZ17,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
title = {On algebraic branching programs of small width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-034}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/034},
eprinttype = {ECCC},
eprint = {TR17-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BringmannIZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/focm/GesmundoHIL16,
author = {Fulvio Gesmundo and
Jonathan D. Hauenstein and
Christian Ikenmeyer and
J. M. Landsberg},
title = {Complexity of Linear Circuits and Geometry},
journal = {Found. Comput. Math.},
volume = {16},
number = {3},
pages = {599--635},
year = {2016},
url = {https://doi.org/10.1007/s10208-015-9258-8},
doi = {10.1007/S10208-015-9258-8},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/focm/GesmundoHIL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BurgisserIP16,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer and
Greta Panova},
editor = {Irit Dinur},
title = {No Occurrence Obstructions in Geometric Complexity Theory},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {386--395},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.49},
doi = {10.1109/FOCS.2016.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BurgisserIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IkenmeyerP16,
author = {Christian Ikenmeyer and
Greta Panova},
editor = {Irit Dinur},
title = {Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity
Theory},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {396--405},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.50},
doi = {10.1109/FOCS.2016.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IkenmeyerP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BurgisserIP16,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer and
Greta Panova},
title = {No occurrence obstructions in geometric complexity theory},
journal = {CoRR},
volume = {abs/1604.06431},
year = {2016},
url = {http://arxiv.org/abs/1604.06431},
eprinttype = {arXiv},
eprint = {1604.06431},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BurgisserIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IkenmeyerM16,
author = {Christian Ikenmeyer and
Stefan Mengel},
title = {On the relative power of reduction notions in arithmetic circuit complexity},
journal = {CoRR},
volume = {abs/1609.05942},
year = {2016},
url = {http://arxiv.org/abs/1609.05942},
eprinttype = {arXiv},
eprint = {1609.05942},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/IkenmeyerM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IkenmeyerL16,
author = {Christian Ikenmeyer and
J. M. Landsberg},
title = {On the complexity of the permanent in various computational models},
journal = {CoRR},
volume = {abs/1610.00159},
year = {2016},
url = {http://arxiv.org/abs/1610.00159},
eprinttype = {arXiv},
eprint = {1610.00159},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/IkenmeyerL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChiantiniILO16,
author = {Luca Chiantini and
Christian Ikenmeyer and
J. M. Landsberg and
Giorgio Ottaviani},
title = {The geometry of rank decompositions of matrix multiplication {I:}
2x2 matrices},
journal = {CoRR},
volume = {abs/1610.08364},
year = {2016},
url = {http://arxiv.org/abs/1610.08364},
eprinttype = {arXiv},
eprint = {1610.08364},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChiantiniILO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GesmundoIP16,
author = {Fulvio Gesmundo and
Christian Ikenmeyer and
Greta Panova},
title = {Geometric complexity theory and matrix powering},
journal = {CoRR},
volume = {abs/1611.00827},
year = {2016},
url = {http://arxiv.org/abs/1611.00827},
eprinttype = {arXiv},
eprint = {1611.00827},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GesmundoIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ikenmeyer15,
author = {Christian Ikenmeyer},
title = {The Saxl conjecture and the dominance order},
journal = {Discret. Math.},
volume = {338},
number = {11},
pages = {1970--1975},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.04.027},
doi = {10.1016/J.DISC.2015.04.027},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Ikenmeyer15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BurgisserIH15,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer and
Jesko H{\"{u}}ttenhain},
title = {Permanent versus determinant: not via saturations of monoids of representations},
journal = {CoRR},
volume = {abs/1501.05528},
year = {2015},
url = {http://arxiv.org/abs/1501.05528},
eprinttype = {arXiv},
eprint = {1501.05528},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BurgisserIH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IkenmeyerMW15,
author = {Christian Ikenmeyer and
Ketan D. Mulmuley and
Michael Walter},
title = {On vanishing of Kronecker coefficients},
journal = {CoRR},
volume = {abs/1507.02955},
year = {2015},
url = {http://arxiv.org/abs/1507.02955},
eprinttype = {arXiv},
eprint = {1507.02955},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/IkenmeyerMW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BurgisserI15,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer},
title = {Fundamental invariants of orbit closures},
journal = {CoRR},
volume = {abs/1511.02927},
year = {2015},
url = {http://arxiv.org/abs/1511.02927},
eprinttype = {arXiv},
eprint = {1511.02927},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BurgisserI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IkenmeyerP15,
author = {Christian Ikenmeyer and
Greta Panova},
title = {Rectangular Kronecker coefficients and plethysms in geometric complexity
theory},
journal = {CoRR},
volume = {abs/1512.03798},
year = {2015},
url = {http://arxiv.org/abs/1512.03798},
eprinttype = {arXiv},
eprint = {1512.03798},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/IkenmeyerP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HuttenhainI14,
author = {Jesko H{\"{u}}ttenhain and
Christian Ikenmeyer},
title = {Binary Determinantal Complexity},
journal = {CoRR},
volume = {abs/1410.8202},
year = {2014},
url = {http://arxiv.org/abs/1410.8202},
eprinttype = {arXiv},
eprint = {1410.8202},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HuttenhainI14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/em/HauensteinIL13,
author = {Jonathan D. Hauenstein and
Christian Ikenmeyer and
J. M. Landsberg},
title = {Equations for Lower Bounds on Border Rank},
journal = {Exp. Math.},
volume = {22},
number = {4},
pages = {372--383},
year = {2013},
url = {https://doi.org/10.1080/10586458.2013.825892},
doi = {10.1080/10586458.2013.825892},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/em/HauensteinIL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BurgisserI13,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer},
title = {Deciding Positivity of Littlewood-Richardson Coefficients},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {4},
pages = {1639--1681},
year = {2013},
url = {https://doi.org/10.1137/120892532},
doi = {10.1137/120892532},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BurgisserI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BurgisserI13,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Explicit lower bounds via geometric complexity theory},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {141--150},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488627},
doi = {10.1145/2488608.2488627},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BurgisserI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0779,
author = {Jonathan D. Hauenstein and
Christian Ikenmeyer and
J. M. Landsberg},
title = {Computer aided methods for lower bounds on the border rank},
journal = {CoRR},
volume = {abs/1305.0779},
year = {2013},
url = {http://arxiv.org/abs/1305.0779},
eprinttype = {arXiv},
eprint = {1305.0779},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GesmundoHIL13,
author = {Fulvio Gesmundo and
Jonathan D. Hauenstein and
Christian Ikenmeyer and
J. M. Landsberg},
title = {Complexity of linear circuits and geometry},
journal = {CoRR},
volume = {abs/1310.1362},
year = {2013},
url = {http://arxiv.org/abs/1310.1362},
eprinttype = {arXiv},
eprint = {1310.1362},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GesmundoHIL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-8368,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer},
title = {Explicit Lower Bounds via Geometric Complexity Theory},
journal = {CoRR},
volume = {abs/1210.8368},
year = {2012},
url = {http://arxiv.org/abs/1210.8368},
eprinttype = {arXiv},
eprint = {1210.8368},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-8368.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BurgisserI11,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Geometric complexity theory and tensor rank},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {509--518},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993704},
doi = {10.1145/1993636.1993704},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BurgisserI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-1350,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer},
title = {Geometric Complexity Theory and Tensor Rank},
journal = {CoRR},
volume = {abs/1011.1350},
year = {2010},
url = {http://arxiv.org/abs/1011.1350},
eprinttype = {arXiv},
eprint = {1011.1350},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-1350.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-03-13 02:54 CET 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:
