Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5154130> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Q5154130 subject Q1458498.
- Q5154130 subject Q7066518.
- Q5154130 subject Q7451530.
- Q5154130 subject Q7451559.
- Q5154130 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.".
- Q5154130 wikiPageExternalLink 0101005.
- Q5154130 wikiPageWikiLink Q11024.
- Q5154130 wikiPageWikiLink Q132364.
- Q5154130 wikiPageWikiLink Q1458498.
- Q5154130 wikiPageWikiLink Q162.
- Q5154130 wikiPageWikiLink Q1622794.
- Q5154130 wikiPageWikiLink Q180634.
- Q5154130 wikiPageWikiLink Q181365.
- Q5154130 wikiPageWikiLink Q190686.
- Q5154130 wikiPageWikiLink Q215675.
- Q5154130 wikiPageWikiLink Q283310.
- Q5154130 wikiPageWikiLink Q2835831.
- Q5154130 wikiPageWikiLink Q2891616.
- Q5154130 wikiPageWikiLink Q3198.
- Q5154130 wikiPageWikiLink Q378201.
- Q5154130 wikiPageWikiLink Q44337.
- Q5154130 wikiPageWikiLink Q5249246.
- Q5154130 wikiPageWikiLink Q5830907.
- Q5154130 wikiPageWikiLink Q603880.
- Q5154130 wikiPageWikiLink Q62888.
- Q5154130 wikiPageWikiLink Q649676.
- Q5154130 wikiPageWikiLink Q656784.
- Q5154130 wikiPageWikiLink Q7045525.
- Q5154130 wikiPageWikiLink Q7049502.
- Q5154130 wikiPageWikiLink Q7066518.
- Q5154130 wikiPageWikiLink Q723897.
- Q5154130 wikiPageWikiLink Q7451530.
- Q5154130 wikiPageWikiLink Q7451559.
- Q5154130 wikiPageWikiLink Q876049.
- Q5154130 wikiPageWikiLink Q8805.
- Q5154130 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.".
- Q5154130 label "Communication complexity".