Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 30
Number of items: 30
  • Open Access
    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
  • Open Access
    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
  • Open Access
    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
  • Open Access
    Christandl, M., Vrana, P., & Zuiddam, J. (2021). Barriers for Fast Matrix Multiplication from Irreversibility. Theory of Computing, 17, Article 2. https://doi.org/10.48550/arXiv.1812.06952, https://doi.org/10.4086/toc.2021.v017a002, https://doi.org/10.4230/LIPIcs.CCC.2019.26
  • Open Access
    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
  • Open Access
    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.48550/arXiv.2002.09472, https://doi.org/10.4230/LIPIcs.CCC.2020.35
  • Open Access
    Arunachalam, S., Vrana, P., & Zuiddam, J. (2020). The asymptotic induced matching number of hypergraphs: Balanced binary strings. Electronic Journal of Combinatorics, 27(3), Article P3.12. https://doi.org/10.37236/9019
  • Zuiddam, J. (2019). The Asymptotic Spectrum of Graphs and the Shannon Capacity. Combinatorica, 39(5), 1173-1184. https://doi.org/10.1007/s00493-019-3992-5
  • Christandl, M., Vrana, P., & Zuiddam, J. (2019). Asymptotic tensor rank of graph tensors: beyond matrix multiplication. Computational Complexity, 28(1), 57-111. https://doi.org/10.1007/s00037-018-0172-8
  • Christandl, M., & Zuiddam, J. (2019). Tensor surgery and tensor rank. Computational Complexity, 28(1), 27-56. https://doi.org/10.1007/s00037-018-0164-8
Page 2 of 3