Minkowski complexity of sets: an easy lower bound

DOI10.4169/AMER.MATH.MONTHLY.124.8.749MaRDI QIDQ4575425zbMATH OpenOpenAlexWikidataFDO

Authors Stasys Jukna

Publication date 13 July 2018

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/amer.math.monthly.124.8.749

Mathematics Subject Classification ID

Extremal set theory (05D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets
• On the exact maximum complexity of Minkowski sums of polytopes
• Lower bounds for the complexity of polynomials
• Minkowski sums of monotone and general simple polygons
• Minkowski complexes and convex threshold dimension

Cites work

• A lower bound on the number of additions in monotone computations
• A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
• Determination of two vectors from the sum
• Introduction to enumerative and analytic combinatorics. With a foreword by Richard Stanley
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems

Cited in

(1)

• Minkowski complexes and convex threshold dimension

This page was built for publication: Minkowski complexity of sets: an easy lower bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575425)