Probabilistic Strategies: Definability and the Tensor Completeness Problem

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]

Authors

Nathan J. Bowler

This author has not been identified. Look up 'Nathan J. Bowler' in Google

Sergey Goncharov 0001

This author has not been identified. Look up 'Sergey Goncharov 0001' in Google

Paul Blain Levy

This author has not been identified. Look up 'Paul Blain Levy' in Google