Succinct Population Protocols for Presburger Arithmetic
From MaRDI portal
Publication:5874313
DOI10.4230/LIPIcs.STACS.2020.40OpenAlexW3013273637MaRDI QIDQ5874313
Stefan Jaax, Blaise Genest, Michael Blondin, Javier Esparza, Martin Helfrich
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/1910.04600
Related Items (6)
Lower bounds on the state complexity of population protocols ⋮ Fast and succinct population protocols for Presburger arithmetic ⋮ Brief Announcement: Population Protocols Decide Double-exponential Thresholds ⋮ Population protocols: beyond runtime analysis ⋮ The complexity of verifying population protocols ⋮ New bounds for the flock-of-birds problem
This page was built for publication: Succinct Population Protocols for Presburger Arithmetic
