19 citations · 20 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LO2026
NEXP-Completeness of Existential Presburger Arithmetic with Divisibility
Ignacio Barros, Michaël Cadilhac, Guillermo A. Pérez
We prove that satisfiability for existential Presburger arithmetic with divisibility (EPAD) is NEXP-hard. Together with the known NEXP upper bound, this establishes NEXP-completene…
cs.DC2026
Population Protocols over Ordered Agents
Michael Blondin, Michaël Cadilhac, Benjamin Courchesne +3
Population protocols are a distributed computation model in which a collection of anonymous, finite-state agents interact in randomly chosen pairs and update their states according…