Shadows of Newton polytopes
From MaRDI portal
Publication:6076195
DOI10.1007/s11856-023-2510-zOpenAlexW3126540402MaRDI QIDQ6076195
Publication date: 23 October 2023
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-023-2510-z
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arithmetic circuits: the chasm at depth four gets wider
- Lower bounds for tropical circuits and dynamic programs
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
- The monotone circuit complexity of Boolean functions
- The complexity of cutting complexes
- Negation can be exponentially powerful
- Expressing combinatorial optimization problems by linear programs
- Disjunctive programming: Properties of the convex hull of feasible points
- Extremal properties of \(0/1\)-polytopes
- Completeness and reduction in algebraic complexity theory
- A framework for the greedy algorithm
- On the distribution of runners on a circle
- Balas formulation for the union of polytopes is optimal
- Moser's shadow problem
- A \(\tau \)-conjecture for Newton polygons
- Some \(0/1\) polytopes need exponential size extended formulations
- On a conjecture of Lindenstrauss
- Fast Parallel Computation of Polynomials Using Few Processors
- Arithmetic Circuits: A survey of recent results and open questions
- Complexity of some parametric integer and network programming problems
- On the depth complexity of formulas
- Some Exact Complexity Results for Straight-Line Computations over Semirings
- On the Number of Additions to Compute Specific Polynomials
- On the Parallel Evaluation of Multivariate Polynomials
- Lower Bounds in a Parallel Model without Bit Operations
- The Parallel Evaluation of General Arithmetic Expressions
- The Matching Polytope has Exponential Extension Complexity
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Communication Complexity
- Linear vs. semidefinite extended formulations
- Optimal assignments in an ordered set: An application of matroid theory
- Matroids and the greedy algorithm
- Absolute irreducibility of polynomials via Newton polytopes
- A lower bound for the shortest path problem
- Subtraction-free complexity, cluster transformations, and spanning trees
