{"id":"https://openalex.org/W4286501281","doi":"https://doi.org/10.1145/3519270.3538463","title":"Brief Announcement: On Polynomial-Time Local Decision","display_name":"Brief Announcement: On Polynomial-Time Local Decision","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286501281","doi":"https://doi.org/10.1145/3519270.3538463"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538463","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038711986","display_name":"Eden Aldema Tshuva","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eden Aldema Tshuva","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083335403","display_name":"Rotem Oshman","orcid":"https://orcid.org/0009-0007-5065-5557"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Rotem Oshman","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.3045,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5938309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"48","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7452445030212402},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7196769714355469},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7109584212303162},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.682313084602356},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.6347357034683228},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.584885835647583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5660501718521118},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.5394744277000427},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.525780439376831},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.523499071598053},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5042458772659302},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4995696544647217},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.4956156015396118},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.48874497413635254},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.48743775486946106},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.47067174315452576},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44995999336242676},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.4334476590156555},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42697829008102417},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.42099684476852417},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.3556826710700989},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29900264739990234},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.24592289328575134},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1613357961177826},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.10809889435768127}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7452445030212402},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7196769714355469},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7109584212303162},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.682313084602356},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.6347357034683228},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.584885835647583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5660501718521118},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.5394744277000427},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.525780439376831},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.523499071598053},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5042458772659302},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4995696544647217},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.4956156015396118},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.48874497413635254},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.48743775486946106},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.47067174315452576},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44995999336242676},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.4334476590156555},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42697829008102417},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.42099684476852417},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3556826710700989},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29900264739990234},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.24592289328575134},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1613357961177826},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.10809889435768127},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519270.3538463","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5899999737739563,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1999120866","https://openalex.org/W2054573207","https://openalex.org/W2123081773","https://openalex.org/W2125495920","https://openalex.org/W2885668823","https://openalex.org/W2921196120","https://openalex.org/W2963272893"],"related_works":["https://openalex.org/W3205703342","https://openalex.org/W3207919203","https://openalex.org/W4286769568","https://openalex.org/W2051933114","https://openalex.org/W1802608971","https://openalex.org/W4293529050","https://openalex.org/W2169625092","https://openalex.org/W2951313060","https://openalex.org/W4300950794","https://openalex.org/W4286501281"],"abstract_inverted_index":{"In":[0],"distributed":[1,23,43],"graph":[2],"algorithms,":[3],"a":[4,30,50,70],"key":[5],"computational":[6,88],"resource":[7],"is":[8,36],"the":[9,13,22,37,42,58,87,117],"communication":[10],"radius":[11],"of":[12,72,90,105],"algorithm,":[14],"i.e.,":[15],"its":[16,33],"locality.":[17],"The":[18],"class":[19,38,118],"LD":[20],"captures":[21,41],"languages":[24,44],"that":[25,45],"can":[26,46],"be":[27,47],"decided":[28,48],"by":[29,49,57],"local":[31,51,54,73],"algorithm;":[32],"nondeterministic":[34],"analog":[35],"NLD,":[39],"which":[40],"algorithm":[52],"with":[53],"advice.":[55],"Inspired":[56],"polynomial":[59],"hierarchy":[60,71],"in":[61,84,109],"complexity":[62],"theory,":[63],"this":[64],"has":[65],"been":[66],"further":[67],"extended":[68],"into":[69],"decision,":[74],"where":[75,96],"each":[76,91],"node":[77,93],"runs":[78],"an":[79],"alternating":[80],"Turing":[81,100],"machine.":[82],"However,":[83],"prior":[85],"work,":[86],"efficiency":[89],"network":[92],"as":[94],"nodes":[95],"allowed":[97],"to":[98],"run":[99],"machines":[101],"for":[102,115],"unbounded":[103],"number":[104],"steps.":[106],"This":[107],"results":[108],"some":[110,121],"undesirable":[111],"and":[112],"unanticipated":[113],"properties:":[114],"example,":[116],"NLD":[119],"includes":[120],"Turing-undecidable":[122],"languages.":[123]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}