Solving linear programs without breaking abstractions
From MaRDI portal
choiceless polynomial timeellipsoid methodfixed-point logic with countinglinear programmingmaximum matching
Logic in computer science (03B70) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27)
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)- Definable Inapproximability: New Challenges for Duplicator
- Definable ellipsoid method, sums-of-squares proofs, and the isomorphism problem
- Maximum matching and linear programming in fixed-point logic with counting
- Canonisation and Definability for Graphs of Bounded Rank Width
- On the Weisfeiler-Leman dimension of fractional packing
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
- Inapproximability of unique games in fixed-point logic with counting
- Symmetric arithmetic circuits
- Symmetric arithmetic circuits
- Limits of symmetric computation (invited talk)
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)
