Brief Announcement: On Polynomial-Time Local Decision

Eden Aldema Tshuva, Rotem Oshman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In distributed graph algorithms, a key computational resource is the communication radius of the algorithm, i.e., its locality. The class LD captures the distributed languages that can be decided by a local algorithm; its nondeterministic analog is the class NLD, which captures the distributed languages that can be decided by a local algorithm with local advice. Inspired by the polynomial hierarchy in complexity theory, this has been further extended into a hierarchy of local decision, where each node runs an alternating Turing machine. However, in prior work, the computational efficiency of each network node as nodes where allowed to run Turing machines for unbounded number of steps. This results in some undesirable and unanticipated properties: for example, the class NLD includes some Turing-undecidable languages.

Original languageEnglish
Title of host publicationPODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages48-50
Number of pages3
ISBN (Electronic)9781450392624
DOIs
StatePublished - 20 Jul 2022
Event41st ACM Symposium on Principles of Distributed Computing, PODC 2022 - Salerno, Italy
Duration: 25 Jul 202229 Jul 2022

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference41st ACM Symposium on Principles of Distributed Computing, PODC 2022
Country/TerritoryItaly
CitySalerno
Period25/07/2229/07/22

Keywords

  • local decision
  • nondeterministic decision
  • polynomial hierarchy

Fingerprint

Dive into the research topics of 'Brief Announcement: On Polynomial-Time Local Decision'. Together they form a unique fingerprint.

Cite this