Over min-plus semirings, VNP equals VP with logarithmic complementations in certificates but not with superlogarithmic ones; width-3 ABPs compute all such problems while width-2 cannot, and hypercube sums over weak models reach VNP power.
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
VP, VNP and Algebraic Branching Programs over Min-Plus Semirings
Over min-plus semirings, VNP equals VP with logarithmic complementations in certificates but not with superlogarithmic ones; width-3 ABPs compute all such problems while width-2 cannot, and hypercube sums over weak models reach VNP power.