APA (7th ed.) Citation

Szusterman, M. (2026). Markovian protocols and an upper bound on the extension complexity of the matching polytope.

Chicago Style (17th ed.) Citation

Szusterman, M. Markovian Protocols and an Upper Bound on the Extension Complexity of the Matching Polytope. 2026.

MLA (9th ed.) Citation

Szusterman, M. Markovian Protocols and an Upper Bound on the Extension Complexity of the Matching Polytope. 2026.

Warning: These citations may not always be 100% accurate.