Christandl, M., Lysikov, V., & Zuiddam, J. (2023). Weighted slice rank and a minimax correspondence to Strassen's spectra. Journal des Mathematiques Pures et Appliquees, 172, 299-329. https://doi.org/10.1016/j.matpur.2023.02.006
Christandl, M., Vrana, P., & Zuiddam, J. (2023). Universal points in the asymptotic spectrum of tensors. Journal of the American Mathematical Society, 36(1), 31-79. https://doi.org/10.1090/jams/996[details]
Kopparty, S., Moshkovitz, G., & Zuiddam, J. (2023). Geometric Rank of Tensors and Subrank of Matrix Multiplication. Discrete Analysis, 2023. https://doi.org/10.19086/da.73322
2022
Christandl, M., Fawzi, O., Ta, H., & Zuiddam, J. (2022). Larger Corner-Free Sets from Combinatorial Degenerations. In M. Braverman (Ed.), 13th Innovations in Theoretical Computer Science Conference: ITCS 2022, January 31-February 3, 2022, Berkeley, CA, USA Article 48 (Leibniz International Proceedings in Informatics; Vol. 215). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2022.48[details]
Derksen, H., Makam, V., & Zuiddam, J. (2022). Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. In S. Lovett (Ed.), 37th Computational Complexity Conference: CCC 2022, July 20-23, 2022, Philadelphia, USA Article 9 (Leibniz International Proceedings in Informatics; Vol. 234). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2022.9[details]
Robere, R., & Zuiddam, J. (2022). Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. In Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021 (pp. 759-769). IEEE Computer Society. https://doi.org/10.1109/FOCS52979.2021.00079
2021
Christandl, M., Gesmundo, F., Michałek, M., & Zuiddam, J. (2021). Border rank nonadditivity for higher order tensors. SIAM Journal on Matrix Analysis and Applications, 42(2), 503-527. https://doi.org/10.1137/20M1357366[details]
Li, Y., & Zuiddam, J. (2021). Quantum Asymptotic Spectra of Graphs and Non-Commutative Graphs, and Quantum Shannon Capacities. IEEE Transactions on Information Theory, 67(1), 416-432. https://doi.org/10.1109/TIT.2020.3032686[details]
Kopparty, S., Moshkovitz, G., & Zuiddam, J. (2020). Geometric rank of tensors and subrank of matrix multiplication. In S. Saraf (Ed.), 35th Computational Complexity Conference: CCC 2020, July 28–31, 2020, Saarbrücken, Germany (Virtual Conference) Article 35 (Leibniz International Proceedings in Informatics; Vol. 169). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2020.35[details]
Christandl, M., Vrana, P., & Zuiddam, J. (2019). Asymptotic tensor rank of graph tensors: beyond matrix multiplication. Computational Complexity, 28(1), 57-111. Advance online publication. https://doi.org/10.1007/s00037-018-0172-8[details]
Christandl, M., Vrana, P., & Zuiddam, J. (2019). Barriers for fast matrix multiplication from irreversibility. In A. Shpilka (Ed.), 34th Computational Complexity Conference: CCC 2019, July 18–20, 2019, New Brunswick, NJ, USA Article 26 (Leibniz International Proceedings in Informatics; Vol. 137). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2019.26[details]
Bringmann, K., Ikenmeyer, C., & Zuiddam, J. (2018). On algebraic branching programs of small width. Journal of the ACM, 65(5), Article 32. Advance online publication. https://doi.org/10.1145/3209663[details]
Christandl, M., Jensen, A. K., & Zuiddam, J. (2018). Tensor rank is not multiplicative under the tensor product. Linear Algebra and Its Applications, 543, 125-139. Advance online publication. https://doi.org/10.1016/j.laa.2017.12.020[details]
Christandl, M., Vrana, P., & Zuiddam, J. (2018). Universal points in the asymptotic spectrum of tensors. In I. Diakonikolas, D. Kempe, & M. Henzinger (Eds.), STOC'18: proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing : June 25-29, 2018, Los Angeles, CA, USA (pp. 289-296). Association for Computing Machinery. https://doi.org/10.1145/3188745.3188766[details]
Bringmann, K., Ikenmeyer, C., & Zuiddam, J. (2017). On algebraic branching programs of small width. In R. O'Donnell (Ed.), 32nd Computational Complexity Conference: CCC 2017, July 6-9, 2017, Riga, Latvia Article 20 (Leibniz International Proceedings in Informatics; Vol. 79). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2017.20[details]
Briët, J., & Zuiddam, J. (2017). On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination. Quantum Information & Computation, 17(1&2), 106-116. https://doi.org/10.26421/QIC17.1-2[details]
Buhrman, H., Christandl, M., & Zuiddam, J. (2017). Nondeterministic quantum communication complexity: The cyclic equality game and iterated matrix multiplication. In C. H. Papadimitriou (Ed.), 8th Innovations in Theoretical Computer Science Conference: ICTS 2017, Januar 9-11, 2017, Berkeley, CA, USA Article 24 (Leibniz International Proceedings in Informatics; Vol. 67). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITCS.2017.24[details]
Zuiddam, J. (2018). Algebraic complexity, asymptotic spectra and entanglement polytopes. [Thesis, externally prepared, Universiteit van Amsterdam]. Institute for Logic, Language and Computation. [details]
De UvA gebruikt cookies voor het meten, optimaliseren en goed laten functioneren van de website. Ook worden er cookies geplaatst om inhoud van derden te kunnen tonen en voor marketingdoeleinden. Klik op ‘Accepteer alle cookies’ om akkoord te gaan met het plaatsen van alle cookies. Of kies voor ‘Weigeren’ om alleen functionele en analytische cookies te accepteren. Lees ook het UvA Privacy statement.