Lics

ACM/IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Fortieth Annual ACM/IEEE Symposium on

Logic in Computer Science (LICS 2025)

Paper: Probabilistic Strategies: Definability and the Tensor Completeness Problem (at LICS 2025)

Authors: Nathan J. Bowler Sergey Goncharov Paul Blain Levy

Abstract

No Abstract Available

BibTeX

  @InProceedings{BowlerGoncharovLevy-ProbabilisticStrate,
    author = 	 {Nathan J. Bowler and Sergey Goncharov and Paul Blain Levy},
    title = 	 {Probabilistic Strategies: Definability and the Tensor Completeness Problem},
    booktitle =  {Proceedings of the Fortieth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2025)},
    year =	 {2025},
    month =	 {June}, 
    pages =      {485--498},
    location =   {Singapore}, 
    publisher =	 {ACM}
  }
   

Last modified: 2026-02-0810:27
Sam Staton