Pages that link to "Item:Q745681"
From MaRDI portal
The following pages link to Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681):
Displaying 27 items.
- Extended formulations for sparsity matroids (Q304267) (← links)
- Common information and unique disjointness (Q343843) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- Extended formulations for polygons (Q714985) (← links)
- On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- Fooling sets and the spanning tree polytope (Q1705643) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Subgraph polytopes and independence polytopes of count matroids (Q1785403) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- A generalization of extension complexity that captures P (Q2345857) (← links)
- On the combinatorial lower bound for the extension complexity of the spanning tree polytope (Q2417165) (← links)
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
- Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- (Q3167619) (redirect page) (← links)
- (Q3386630) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- (Q4612478) (← links)
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047) (← links)
- Extended formulations of lower-truncated transversal polymatroids (Q4999331) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
- The role of rationality in integer-programming relaxations (Q6126664) (← links)
