Solving linear programs without breaking abstractions
From MaRDI portal
linear programmingmaximum matchingellipsoid methodfixed-point logic with countingchoiceless polynomial time
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Logic in computer science (03B70)
Recommendations
- Maximum matching and linear programming in fixed-point logic with counting
- On the Power of Symmetric Linear Programs
- Polynomial size linear programs for problems in \textsc{P}
- Definable ellipsoid method, sums-of-squares proofs, and the isomorphism problem
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
Cited in
(11)- Inapproximability of unique games in fixed-point logic with counting
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Maximum matching and linear programming in fixed-point logic with counting
- Definable ellipsoid method, sums-of-squares proofs, and the isomorphism problem
- Symmetric arithmetic circuits
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
- Symmetric arithmetic circuits
- Canonisation and Definability for Graphs of Bounded Rank Width
- On the Weisfeiler-Leman dimension of fractional packing
- Limits of symmetric computation (invited talk)
- Definable Inapproximability: New Challenges for Duplicator
This page was built for publication: Solving linear programs without breaking abstractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177754)
