Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Communication_complexity> ?p ?o. }
Showing items 1 to 22 of
22
with 100 items per page.
- Communication_complexity abstract "The notion of communication complexity was introduced by Yao in 1979,who investigated the following problem involving two separated parties (Alice and Bob). Alice receives an n-bit string x and Bob another n-bit string y, and the goal is for one of them (say Bob) to compute a certain function f(x,y) with the least amount of communication between them. Note that here we are not concerned about the number of computational steps, or the size of the computer memory used. Communication complexity tries to quantify the amount of communication required for such distributed computations.Of course they can always succeed by having Alice send her whole n-bit string to Bob, who then computes the function, but the idea here is to find clever ways of calculating f with fewer than n bits of communication.This abstract problem is relevant in many contexts: in VLSI circuit design, for example, one wants to minimize energy used by decreasing the amount of electric signals required between the different components during a distributed computation. The problem is also relevant in the study of data structures, and in the optimization of computer networks. For a survey of the field, see the book by Kushilevitz and Nisan.".
- Communication_complexity wikiPageExternalLink 0101005.
- Communication_complexity wikiPageID "50329".
- Communication_complexity wikiPageRevisionID "605611231".
- Communication_complexity hasPhotoCollection Communication_complexity.
- Communication_complexity subject Category:Communication.
- Communication_complexity subject Category:Computational_complexity_theory.
- Communication_complexity subject Category:Quantum_complexity_theory.
- Communication_complexity subject Category:Quantum_information_science.
- Communication_complexity comment "The notion of communication complexity was introduced by Yao in 1979,who investigated the following problem involving two separated parties (Alice and Bob). Alice receives an n-bit string x and Bob another n-bit string y, and the goal is for one of them (say Bob) to compute a certain function f(x,y) with the least amount of communication between them. Note that here we are not concerned about the number of computational steps, or the size of the computer memory used.".
- Communication_complexity label "Communication complexity".
- Communication_complexity label "Complexité de la communication".
- Communication_complexity label "Kommunikationskomplexität".
- Communication_complexity label "通信複雑性".
- Communication_complexity sameAs Kommunikationskomplexität.
- Communication_complexity sameAs Complexité_de_la_communication.
- Communication_complexity sameAs 通信複雑性.
- Communication_complexity sameAs m.0d9qw.
- Communication_complexity sameAs Q5154130.
- Communication_complexity sameAs Q5154130.
- Communication_complexity wasDerivedFrom Communication_complexity?oldid=605611231.
- Communication_complexity isPrimaryTopicOf Communication_complexity.