scientific article; zbMATH DE number 7559421
From MaRDI portal
Publication:5089218
DOI10.4230/LIPIcs.MFCS.2020.50MaRDI QIDQ5089218
Hans Raj Tiwary, Oliveira Mateus de Oliveira, Lars Jaffke
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2001.05583
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound technique for the size of nondeterministic finite automata
- Smallest compact formulation for the permutahedron
- Graph minors. X: Obstructions to tree-decomposition
- Expressing combinatorial optimization problems by linear programs
- On minimal grammar problems for finite languages
- Lower bounds for context-free grammars
- A short proof that the extension complexity of the correlation polytope grows exponentially
- Some \(0/1\) polytopes need exponential size extended formulations
- A note on the extension complexity of the knapsack polytope
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization
- Arithmetic Branching Programs with Memory
- Network Formulations of Mixed-Integer Programs
- Extended Formulations for Packing and Partitioning Orbitopes
- Branched Polyhedral Systems
- The Polytope of Context-Free Grammar Constraints
- On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group
- Constructing Extended Formulations from Reflection Relations
- Parameterized Algorithms
- Geometry of cuts and metrics
This page was built for publication:
