Szusterman, M. (2026). Markovian protocols and an upper bound on the extension complexity of the matching polytope.
Citazione stile Chigago Style (17a edizione)Szusterman, M. Markovian Protocols and an Upper Bound on the Extension Complexity of the Matching Polytope. 2026.
Citatione MLA (9a ed.)Szusterman, M. Markovian Protocols and an Upper Bound on the Extension Complexity of the Matching Polytope. 2026.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.