2 papers
cs.DC2026
Generalizing LCL Complexity Gaps to Unbounded Degree via Monadic Second-Order Properties
Chiara Piombi
The last decade of research on the LOCAL model has seen tremendous progress in understanding locally checkable labeling (LCL) problems, culminating in an almost complete classifica…
math.CO2026
On the complex zeros and the computational complexity of approximating the reliability polynomial
Ferenc Bencs, Chiara Piombi, Guus Regts
In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability p…