A star gadget with 2n triangles on one central variable in a binary VCSP produces an exponential ascent of length 10*2^n - 9 by intertwining two linear sublandscapes.
Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four , booktitle =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Binary constraints on one additional variable can create exponential ascents
A star gadget with 2n triangles on one central variable in a binary VCSP produces an exponential ascent of length 10*2^n - 9 by intertwining two linear sublandscapes.