scientific article; zbMATH DE number 7559421
From MaRDI portal
Publication:5089218
Cites work
- A lower bound technique for the size of nondeterministic finite automata
- A note on the extension complexity of the knapsack polytope
- A short proof that the extension complexity of the correlation polytope grows exponentially
- Arithmetic branching programs with memory
- Branched polyhedral systems
- Constructing extended formulations from reflection relations
- Exponential lower bounds for polytopes in combinatorial optimization
- Expressing combinatorial optimization problems by linear programs
- Extended formulations for packing and partitioning orbitopes
- Geometry of cuts and metrics
- Graph minors. X: Obstructions to tree-decomposition
- scientific article; zbMATH DE number 1688372 (Why is no real title available?)
- scientific article; zbMATH DE number 53657 (Why is no real title available?)
- scientific article; zbMATH DE number 1263275 (Why is no real title available?)
- scientific article; zbMATH DE number 2201362 (Why is no real title available?)
- Lower bounds for context-free grammars
- Network Formulations of Mixed-Integer Programs
- On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
- On minimal grammar problems for finite languages
- Optimal regular expressions for permutations
- Parameterized algorithms
- Smallest compact formulation for the permutahedron
- Some \(0/1\) polytopes need exponential size extended formulations
- The Polytope of Context-Free Grammar Constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089218)
