@inproceedings{3ceaa8da7d63423ebc704f16a613acbd,
title = "Bounded Simultaneous Messages",
abstract = "We consider the following question of bounded simultaneous messages (BSM) protocols: Can computationally unbounded Alice and Bob evaluate a function f(x, y) of their inputs by sending polynomial-size messages to a computationally bounded Carol? The special case where f is the mod-2 inner-product function and Carol is bounded to AC0 has been studied in previous works. The general question can be broadly motivated by applications in which distributed computation is more costly than local computation. In this work, we initiate a more systematic study of the BSM model, with different functions f and computational bounds on Carol. In particular, we give evidence against the existence of BSM protocols with polynomial-size Carol for naturally distributed variants of NP-complete languages.",
keywords = "Algebraic degree, Instance Hiding, Lower Bounds, Preprocessing, Simultaneous Messages",
author = "Andrej Bogdanov and Krishnamoorthy Dinesh and Yuval Filmus and Yuval Ishai and Avi Kaplan and Sruthi Sekar",
note = "Publisher Copyright: {\textcopyright} 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.; 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023 ; Conference date: 18-12-2023 Through 20-12-2023",
year = "2023",
month = dec,
doi = "https://doi.org/10.4230/LIPIcs.FSTTCS.2023.23",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Patricia Bouyer and Srikanth Srinivasan",
booktitle = "43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023",
}