The Library
Browse by Warwick Author
Up a level |
Number of items: 8.
2024
Dutta, Pranjal, Gesmundo, Fulvio, Ikenmeyer, Christian, Jindal, Gorav and Lysikov, Vladimir (2024) Homogeneous algebraic complexity theory and algebraic formulas. In: 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), Berkeley, CA, USA, 30 Jan - 2 Feb 2024. Published in: Leibniz International Proceedings in Informatics (LIPIcs), 287 43:1-43:23. ISBN 9783959773096. doi:10.4230/LIPIcs.ITCS.2024.43 ISSN 1868-8969.
Ikenmeyer, Christian and Panova, Greta (2024) All Kronecker coefficients are reduced Kronecker coefficients. In: FPSAC 2024, Ruhr-UniversitΓ€t Bochum, 22-26 Jul 2024 (In Press)
Dutta, Pranjal, Gesmundo, Fulvio, Ikenmeyer, Christian, Jindal, Gorav and Lysikov, Vladimir (2024) Fixed-parameter debordering of Waring rank. In: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Clermont-Ferrand, France, 12-14 Mar 2024. Published in: Leibniz International Proceedings in Informatics (LIPIcs) ISSN 1868-8969. (In Press)
Dutta, Pranjal, Ikenmeyer, Christian, Komarath, Balagopal, Mittal, Harshil, Nanoti, Saraswati and Thakkar, Dhara (2024) On the power of border width-2 ABPs over fields of characteristic 2. In: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Clermont-Ferrand, France, 12-14 Mar 2024. Published in: Leibniz International Proceedings in Informatics (LIPIcs) ISSN 1868-8969. (In Press)
2023
Ikenmeyer, Christian, Pak, Igor and Panova, Greta (2023) Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. International Mathematics Research Notices . rnad273. doi:10.1093/imrn/rnad273 ISSN 1073-7928. (In Press)
Ikenmeyer, Christian, Pak, Igor and Panova, Greta (2023) Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. In: ACM-SIAM Symposium on Discrete Algorithms (SODA23), Florence, Italy ; Hybrid, 22-25 Jan 2023. Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) pp. 3573-3586. ISBN 9781611977554. doi:10.1137/1.9781611977554.ch136
2022
Ikenmeyer, Christian, Komarath, Balagopal and Saurabh, Nitin (2022) Karchmer-Wigderson games for hazard-free computation. In: 14th Innovations in Theoretical Computer Science (ITCS), MIT in Cambridge, Massachusetts, 11-13 Jan 2023. Published in: Proceedings of the 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 251 ISBN 9783959772631. doi:10.4230/LIPIcs.ITCS.2023.74 ISSN 1868-8969.
Ikenmeyer, Christian and Pak, Igor (2022) What is in# P and what is not? In: FOCS 2022: 63rd IEEE Symposium on Foundations of Computer Science, Denver, USA, Oct 31 - Nov 3, 2022. Published in: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) pp. 860-871. doi:10.1109/FOCS54457.2022.00087
This list was generated on Tue Apr 23 16:51:17 2024 BST.