Descriptive Complexity for Distributed Computing with Circuits

Tutkimustuotos: KonferenssiartikkeliTieteellinenvertaisarvioitu

1 Sitaatiot (Scopus)
5 Lataukset (Pure)

Abstrakti

We consider distributed algorithms in the realistic scenario where distributed message passing is operated by circuits. We show that within this setting, modal substitution calculus MSC precisely captures the expressive power of circuits. The result is established via constructing translations that are highly efficient in relation to size. We also observe that the coloring algorithm based on Cole-Vishkin can be specified by logarithmic size programs (and thus also logarithmic size circuits) in the bounded-degree scenario.

AlkuperäiskieliEnglanti
Otsikko48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023
ToimittajatJerome Leroux, Sylvain Lombardy, David Peleg
KustantajaSchloss Dagstuhl - Leibniz-Zentrum für Informatik
ISBN (elektroninen)9783959772921
DOI - pysyväislinkit
TilaJulkaistu - elok. 2023
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
TapahtumaInternational Symposium on Mathematical Foundations of Computer Science - Bordeaux, Ranska
Kesto: 28 elok. 20231 syysk. 2023

Julkaisusarja

NimiLeibniz International Proceedings in Informatics, LIPIcs
Vuosikerta272
ISSN (elektroninen)1868-8969

Conference

ConferenceInternational Symposium on Mathematical Foundations of Computer Science
Maa/AlueRanska
KaupunkiBordeaux
Ajanjakso28/08/231/09/23

Rahoitus

Funding Antti Kuusisto and Veeti Ahvonen were supported by the Academy of Finland project Theory of computational logics, grant numbers 352419, 352420, 353027, 324435, 328987. Antti Kuusisto was also supported by the Academy of Finland consortium project Explaining AI via Logic (XAILOG), grant number 345612. Veeti Ahvonen was also supported by the Vilho, Yrjö and Kalle Väisälä Foundation of the Finnish Academy of Science and Letters.

Julkaisufoorumi-taso

  • Jufo-taso 1

!!ASJC Scopus subject areas

  • Software

Sormenjälki

Sukella tutkimusaiheisiin 'Descriptive Complexity for Distributed Computing with Circuits'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä