A new hierarchy, t-sos submodularity, provides polynomial-time checkable sufficient conditions for submodularity and, at high t, an exact characterization.
NP -hardness of deciding convexity of quartic polynomials and related problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sum of Squares Submodularity
A new hierarchy, t-sos submodularity, provides polynomial-time checkable sufficient conditions for submodularity and, at high t, an exact characterization.