Nathan J. Bowler, Sergey Goncharov 0001, Paul Blain Levy. Probabilistic Strategies: Definability and the Tensor Completeness Problem. In 40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025. pages 485-498, IEEE, 2025. [doi]
Abstract is missing.