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:
PODC (2019)
Keyphrases
</>
polynomial hierarchy
decision problems
distributed environment
database
cooperative
np complete
shortest path
decision trees
database systems
multi agent
computational cost
peer to peer
first order logic
computational issues