Cita APA (7a ed.)

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

Cita Chicago Style (17a ed.)

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

Cita MLA (9a ed.)

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