TY - GEN

T1 - Brief Announcement

AU - Tshuva, Eden Aldema

AU - Oshman, Rotem

N1 - Publisher Copyright:
© 2022 Owner/Author.

PY - 2022/7/20

Y1 - 2022/7/20

N2 - 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.

AB - 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.

KW - local decision

KW - nondeterministic decision

KW - polynomial hierarchy

UR - http://www.scopus.com/inward/record.url?scp=85135362362&partnerID=8YFLogxK

U2 - 10.1145/3519270.3538463

DO - 10.1145/3519270.3538463

M3 - פרסום בספר כנס

AN - SCOPUS:85135362362

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 48

EP - 50

BT - PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

Y2 - 25 July 2022 through 29 July 2022

ER -