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]
@inproceedings{BowlerGL25,
title = {Probabilistic Strategies: Definability and the Tensor Completeness Problem},
author = {Nathan J. Bowler and Sergey Goncharov 0001 and Paul Blain Levy},
year = {2025},
doi = {10.1109/LICS65433.2025.00043},
url = {https://doi.org/10.1109/LICS65433.2025.00043},
researchr = {https://researchr.org/publication/BowlerGL25},
cites = {0},
citedby = {0},
pages = {485-498},
booktitle = {40th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2025, Singapore, June 23-26, 2025},
publisher = {IEEE},
isbn = {979-8-3315-7900-5},
}