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.
On non-serial dynamic programming
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A controlled doubling construction yields a pathwidth-three VCSP in which every ascent in the fitness landscape is exponentially long.
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.
-
All ascents exponential from valued constraint graphs of pathwidth three
A controlled doubling construction yields a pathwidth-three VCSP in which every ascent in the fitness landscape is exponentially long.