Pages that link to "Item:Q5918910"

The following pages link to Extended formulations from communication protocols in output-efficient time (Q5918910):

Displaying 10 items.

• Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
• Computing the optimal IO sequences of a protocol in polynomial time (Q1183459) (← links)
• Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
• Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
• (Q3386630) (← links)
• Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
• (Q5919380) (redirect page) (← links)
• A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
• The role of rationality in integer-programming relaxations (Q6126664) (← links)
• Slack matrices, \(k\)-products, and 2-level polytopes (Q6558684) (← links)