Login / Signup
The distributed complexity of locally checkable problems on paths is decidable.
Alkida Balliu
Sebastian Brandt
Yi-Jun Chang
Dennis Olivetti
Mikaël Rabie
Jukka Suomela
Published in:
CoRR (2018)
Keyphrases
</>
polynomial hierarchy
decision problems
distributed systems
multi agent
evolutionary algorithm
np complete
distributed environment
database
databases
cooperative
worst case
benchmark problems
problems involving