FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2007654329> ?p ?o ?g. }

• W2007654329 endingPage "166" @default.
• W2007654329 startingPage "137" @default.
• W2007654329 abstract "In the multiparty communication game (CFL game) of Chandra, Furst, and Lipton [Proceedings of the 15th Annual ACM Symposium on Theory of Computing, Boston, MA, 1983, pp. 94--99] k players collaboratively evaluate a function f(x0 , . . . , xk-1) in which player i knows all inputs except xi. The players have unlimited computational power. The objective is to minimize communication. In this paper, we study the SIMULTANEOUS MESSAGES (SM) model of multiparty communication complexity. The SM model is a restricted version of the CFL game in which the players are not allowed to communicate with each other. Instead, each of the k players simultaneously sends a message to a referee, who sees none of the inputs. The referee then announces the function value. We prove lower and upper bounds on the SM complexity of several classes of explicit functions. Our lower bounds extend to randomized SM complexity via an entropy argument. A lemma establishing a tradeoff between average Hamming distance and range size for transformations of the Boolean cube might be of independent interest. Our lower bounds on SM complexity imply an exponential gap between the SM model and the CFL model for up to $(log n)^{1-epsilon}$ players for any $epsilon > 0$. This separation is obtained by comparing the respective complexities of the Generalized Addressing Function, GAFG,k, where G is a group of order n. We also combine our lower bounds on SM complexity with the ideas of Håstad and Goldmann [Comput. Complexity, 1 (1991), pp. 113--129] to derive superpolynomial lower bounds for certain depth-2 circuits computing a function related to the GAF function. We prove some counterintuitive upper bounds on SM complexity. We show that {sf GAF}$_{mathbb{Z}_2^t,3}$ has SM complexity $O(n^{0.92})$. When the number of players is at least $clog n$, for some constant c > 0, our SM protocol for {sf GAF}$_{mathbb{Z}_2^t,k}$ has polylog(n) complexity. We also examine a class of functions defined by certain depth-2 circuits. This class includes the Generalized Inner Product function and Majority of Majorities. When the number of players is at least 2+log n, we obtain polylog(n) upper bounds for this class of functions." @default.
• W2007654329 created "2016-06-24" @default.
• W2007654329 creator A5014978503 @default.
• W2007654329 creator A5031221780 @default.
• W2007654329 creator A5069623436 @default.
• W2007654329 creator A5078455094 @default.
• W2007654329 date "2003-01-01" @default.
• W2007654329 modified "2023-09-26" @default.
• W2007654329 title "Communication Complexity of Simultaneous Messages" @default.
• W2007654329 cites W1489774662 @default.
• W2007654329 cites W1967909233 @default.
• W2007654329 cites W1974827405 @default.
• W2007654329 cites W2027328186 @default.
• W2007654329 cites W2031934066 @default.
• W2007654329 cites W2036656440 @default.
• W2007654329 cites W2041210515 @default.
• W2007654329 cites W2045075842 @default.
• W2007654329 cites W2051019379 @default.
• W2007654329 cites W2060270693 @default.
• W2007654329 cites W2074564146 @default.
• W2007654329 cites W2085590458 @default.
• W2007654329 cites W2099111195 @default.
• W2007654329 cites W2107998050 @default.
• W2007654329 cites W2496163386 @default.
• W2007654329 cites W2611355853 @default.
• W2007654329 cites W4210551624 @default.
• W2007654329 doi "https://doi.org/10.1137/s0097539700375944" @default.
• W2007654329 hasPublicationYear "2003" @default.
• W2007654329 type Work @default.
• W2007654329 sameAs 2007654329 @default.
• W2007654329 citedByCount "78" @default.
• W2007654329 countsByYear W20076543292012 @default.
• W2007654329 countsByYear W20076543292013 @default.
• W2007654329 countsByYear W20076543292014 @default.
• W2007654329 countsByYear W20076543292015 @default.
• W2007654329 countsByYear W20076543292016 @default.
• W2007654329 countsByYear W20076543292017 @default.
• W2007654329 countsByYear W20076543292018 @default.
• W2007654329 countsByYear W20076543292019 @default.
• W2007654329 countsByYear W20076543292020 @default.
• W2007654329 countsByYear W20076543292021 @default.
• W2007654329 countsByYear W20076543292022 @default.
• W2007654329 crossrefType "journal-article" @default.
• W2007654329 hasAuthorship W2007654329A5014978503 @default.
• W2007654329 hasAuthorship W2007654329A5031221780 @default.
• W2007654329 hasAuthorship W2007654329A5069623436 @default.
• W2007654329 hasAuthorship W2007654329A5078455094 @default.
• W2007654329 hasBestOaLocation W20076543292 @default.
• W2007654329 hasConcept C11413529 @default.
• W2007654329 hasConcept C114614502 @default.
• W2007654329 hasConcept C118615104 @default.
• W2007654329 hasConcept C134306372 @default.
• W2007654329 hasConcept C14036430 @default.
• W2007654329 hasConcept C157125643 @default.
• W2007654329 hasConcept C159985019 @default.
• W2007654329 hasConcept C179145077 @default.
• W2007654329 hasConcept C179799912 @default.
• W2007654329 hasConcept C187455244 @default.
• W2007654329 hasConcept C18903297 @default.
• W2007654329 hasConcept C192562407 @default.
• W2007654329 hasConcept C193319292 @default.
• W2007654329 hasConcept C204323151 @default.
• W2007654329 hasConcept C2777759810 @default.
• W2007654329 hasConcept C33923547 @default.
• W2007654329 hasConcept C41008148 @default.
• W2007654329 hasConcept C46757340 @default.
• W2007654329 hasConcept C57273362 @default.
• W2007654329 hasConcept C63361517 @default.
• W2007654329 hasConcept C73150493 @default.
• W2007654329 hasConcept C77553402 @default.
• W2007654329 hasConcept C78458016 @default.
• W2007654329 hasConcept C86803240 @default.
• W2007654329 hasConceptScore W2007654329C11413529 @default.
• W2007654329 hasConceptScore W2007654329C114614502 @default.
• W2007654329 hasConceptScore W2007654329C118615104 @default.
• W2007654329 hasConceptScore W2007654329C134306372 @default.
• W2007654329 hasConceptScore W2007654329C14036430 @default.
• W2007654329 hasConceptScore W2007654329C157125643 @default.
• W2007654329 hasConceptScore W2007654329C159985019 @default.
• W2007654329 hasConceptScore W2007654329C179145077 @default.
• W2007654329 hasConceptScore W2007654329C179799912 @default.
• W2007654329 hasConceptScore W2007654329C187455244 @default.
• W2007654329 hasConceptScore W2007654329C18903297 @default.
• W2007654329 hasConceptScore W2007654329C192562407 @default.
• W2007654329 hasConceptScore W2007654329C193319292 @default.
• W2007654329 hasConceptScore W2007654329C204323151 @default.
• W2007654329 hasConceptScore W2007654329C2777759810 @default.
• W2007654329 hasConceptScore W2007654329C33923547 @default.
• W2007654329 hasConceptScore W2007654329C41008148 @default.
• W2007654329 hasConceptScore W2007654329C46757340 @default.
• W2007654329 hasConceptScore W2007654329C57273362 @default.
• W2007654329 hasConceptScore W2007654329C63361517 @default.
• W2007654329 hasConceptScore W2007654329C73150493 @default.
• W2007654329 hasConceptScore W2007654329C77553402 @default.
• W2007654329 hasConceptScore W2007654329C78458016 @default.
• W2007654329 hasConceptScore W2007654329C86803240 @default.
• W2007654329 hasIssue "1" @default.
• W2007654329 hasLocation W20076543291 @default.

• next