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.
citation dossier
Journal of Algorithms , volume=
1Pith papers citing it
1reference links
cs.DMtop field · 1 papers
UNVERDICTEDtop verdict bucket · 1 papers
why this work matters in Pith
Pith has found this work in 1 reviewed paper. Its strongest current cluster is cs.DM (1 papers). The largest review-status bucket among citing papers is UNVERDICTED (1 papers). For highly cited works, this page shows a dossier first and a bounded explorer second; it never tries to render every citing paper at once.
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.