
	Where results make sense

Topic: Communication complexity

Related Topics

computational complexity theory

complex analysis

complexity theory

complex plane

Complexity classes P and NP

complexity class

complex conjugate

complex systems

military industrial complex

complex manifold

NP complexity

In the News (Sun 27 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Communication complexity - Wikipedia, the free encyclopedia
		The notion of communication complexity (CC) was introduced by Yao in 1979, who investigated the following problem involving two separated parties (Alice and Bob).
		The randomized complexity is simply defined as the number of bits exchanged in such a protocol.
		The first one is the qubit-communication model, where the parties can use quantum communication instead of classical communication, for example by exchanging photons through an optical fiber.
	en.wikipedia.org /wiki/Communication_complexity (1940 words)

	IBM Research \| Almaden Research Center \| Computer Science
		Our recent work in complexity theory addresses problems in the following areas: communication complexity, lower bounds in concrete models of computation, derandomization, complexity of lattice problems, and zero-knowledge protocols.
		Specific results include: characterizations of sequential communication complexity models (which arise in data stream algorithms) in terms of VC dimension; equivalence of basic complexity models that correspond to sequential and parallel communication; and lower bounds for functions that arise from data stream problems and from circuit complexity theory.
		For the model of one-way communication complexity, Ziv Bar-Yossef, T.S. Jayram, and Iordanis Kerenidis have exhibited a problem for which there is a quantum protocol that is exponentially more powerful than any bounded-error randomized protocol.
	www.almaden.ibm.com /cs/projects/complexity (1273 words)

	On Data Structures and Asymmetric Communication Complexity (Site not responding. Last check: 2007-10-13)
		In this paper we consider two party communication complexity when the input sizes of the two players differ significantly, the ``asymmetric'' case.
		Most of previous work on communication complexity only considers the total number of bits sent, but we study tradeoffs between the number of bits the first player sends and the number of bits the second sends.
		These types of questions are closely related to the complexity of static data structure problems in the cell probe model.
	www.brics.dk /RS/94/41 (145 words)

	Communication complexity (Site not responding. Last check: 2007-10-13)
		In a second model the communication is performed with classical bits but the parties allowed to manipulate an unlimited supply of entangled states as part of their protocols.
		The third model involves access to previously entanglement in addition to qubit communication and is the least explored the three quantum models.
		Communication Complexity studies how many bits ALICE and BOB have to exchange to computer a function.
	www.freeglossary.com /Communication_complexity (705 words)

	Study: Communication Complexity Found
		How we communicate is to share lots of information that is not useful for action or personal change.
		In an environment where communication technology is changing hourly, it would be foolhardy to predict the exact look and feel of reinvented communication.
		Because people can communicate faster than they can change their behaviors, communication patterns can be used as a leading indicator of implementation issues and trends.
	www.simplerwork.com /c/c11.htm (1168 words)

	Mammal Communication - Article in SETI NEWS
		If one is willing to admit that all animals communicate (in some way or another) then the next question might simply be to ask how complex their communication systems are.
		A mathematical tool for actually calculating the complexity of a communication system was invented in the late 1940s by Claude Shannon of Bell Labs (who, incidentally, thanked our own Barney Oliver for helpful discussions in the acknowledgements of this seminal paper).
		If communications were ever to ensue, we might hope that they would look upon us with more respect than perhaps we have looked upon most other species of this planet to date.
	www.tusker.com /Archaeo/art.SetiNews.htm (1330 words)

	Quantum Communication Complexity (Site not responding. Last check: 2007-10-13)
		Holevo's theorem rules out the possibility of communicating more than $n$ bits of classical information by the transmission of $n$ quantum bits between unentangled parties.
		Yet, there are distributed tasks that cannot be accomplished at all in a classical world when communication is not allowed, but that become possible if the non-communicating parties share prior entanglement.
		This leads to wondering how expensive it is, in terms of classical communication, to provide an exact simulation of the spooky power of entanglement.
	www.cs.berkeley.edu /Seminar.archive/2000/08.Aug/000817.brassard.html (175 words)

	Study: How We Measure Communication
		Since people's ability to communicate change precedes their ability to implement it, communication measures could be used as a leading indicator -- if we measure the right things.
		While some "most admired companies" seemed to use communication tracking to drive continuous improvement, the overwhelming majority of companies (85%+) that formally tracked employee views did so annually or every two to three years in "organizational health" studies.
		Keeping in mind that these are the people who focus on the customer and execute competitive strategies, we asked participants what would happen to their companies if they formally tracked customer and competitive data like employee data -- once every few years.
	www.simplerwork.com /c/c3.htm (895 words)

	Quantum Communication Complexity
		What is striking about the subject is that the communication is all classical: only classical bits and pieces are transmitted and received, so one would have thought that classical reasoning about the amount of information required to be sent would be valid.
		That is, the existence of entanglement at separated spatial locations does not reduce the number of communication bits that is necessary to convey a piece of information between the locations.
		In entanglement-assisted communication, we accept this fact, and examine instead situations where the knowledge sought by Alice, or any of the parties, is a function of classical information which, like the entanglement, is initially distributed among the parties.
	cam.qubit.org /articles/intros/gmn/gmn.php (3724 words)

	Communication Complexity of Secure Computation (Extended Abstract) - Franklin, Yung (ResearchIndex)
		The goal is for n participants to jointly compute the output of some n-ary function (in this case, the sum of the votes), while protecting their individual inputs against some form of misbehavior.
		In this paper, we initiate the investigation of the communication complexity of unconditionally secure multi-party computation, and its relation with various...
		2 Communication with secrecy constraints (context) - Orlitsky, Gamal - 1984 ACM DBLP
	citeseer.ist.psu.edu /franklin92communication.html (536 words)

	WPI Computer Science - Communication Complexity Theory: Models, Techniques, Applications (Site not responding. Last check: 2007-10-13)
		The objective is to minimize the amount of communication required between the processors for the computation.
		Originally invented to study the complexity of VLSI computations, communication complexity has been applied in a variety of contexts.
		We use perturbation inequalities for singular values of a matrix to prove the underlying result in communication complexity theory.
	www.cs.wpi.edu /News/Colloquium/19967/19960226.html (226 words)

	On Rounds in Quantum Communication - Klauck (ResearchIndex)
		We show that f k needs quantum communication n) if Bob starts the communication and the number of rounds is limited to k (for any constant k).
		Interaction in Quantum Communication and the Complexity of..
		1.3: One-Way Communication Complexity And The Neciporuk Lower Bound on..
	citeseer.ist.psu.edu /klauck00rounds.html (688 words)

	SIROCCO 2006 - HOME
		The Colloquia on Structural Information and Communication Complexity (SIROCCO) focus on the relationship between computing and communication, i.e., the study of those factors that are significant for the computability and the communication complexity of problems and on the interplay between structure, knowledge and complexity.
		Original papers are solicited from all those areas where the interplay between complexity and communication takes place.
		Topics of interest include (but are not limited to): communication complexity, distributed algorithms and data structures, information dissemination, mobile agent computing, models of communication, network topologies, routing protocols, sense of direction, structural properties.
	sirocco06.csc.liv.ac.uk (221 words)

	Computational Complexity Conference Call for Papers (Site not responding. Last check: 2007-10-13)
		We also encourage results from other areas of computer science and mathematics motivated by topics in complexity theory.
		The instructions for final copies will be communicated to authors of accepted papers.
		This model retains the advantages of the smaller conferences and, at the same time, facilitates communication among researchers in different fields in computer science and engineering.
	facweb.cs.depaul.edu /jrogers/complexity/cfp.htm (678 words)

	Hromkovic, Juraj; Hromkovic, J.: Communication Complexity and Parallel Computing: The Application of Communication ... (Site not responding. Last check: 2007-10-13)
		This book treats communication complexity as an abstract measure of the complexity of computing problems.
		Its main aim is to show how the theoretical study of communication complexity can be useful in the process of designing effective parallel algorithms.
		The book carefully explains how to get important information about the parallel complexity of specific computing problems from knowledge of their communication complexity, while also providing motivation for further research.
	www.forbesbookclub.com /bookpage.asp?prod_cd=IE2YW (107 words)

	Connections Between Integer Programming, Communication Complexity and Propositional Proof Complexity (Site not responding. Last check: 2007-10-13)
		When used for satisfiability algorithms, such techniques can be viewed as propositional proof systems that prove tautologies (by establishing that the negation of a formula is unsatisfiable), and the proof structure is a successive derivation of low-degree inequalities over the rationals until a contradiction is found.
		A major challenge on the frontier of propositional proof complexity is to understand the power of these propositional proof systems (which we call "threshold logics").
		Our primary contributions are: establishing the reduction from proof size lower bounds to communication lower bounds, and new lower bounds (that fall slightly short of what is needed for a superpolynomial proof size lower bound) for the NOF communication complexity of the set disjointness function.
	www.cs.ubc.ca /labs/beta/Div/theoryday/connections.html (245 words)

	COMMUNICATION COMPLEXITY book
		This page contains some information related to the book ``Communication Complexity'', by Eyal Kushilevitz and Noam Nisan that was published by Cambridge University Press.
		Page (37) Definition 3.24 and Exercise 3.25: the complexity measures here are all zero-error measures (that is, protocol are not allowed to err but the communication complexity is measures as the expectation with respect to the distribution under consideration).
		If Alice holds a, Bob hold b and WLOG a is smaller than b then in future iterations it might happen that Alice's median is larger than b (or Bob's median is smaller than a).
	www.cs.technion.ac.il /~eyalk/book.html (580 words)

	Complexity Theory 2004/5 Moni Naor
		Typical resources are time and memory, but other measures are of interest as well, such as parallelism, communication and randomness.
		The goal of the course is to provide a firm foundation of the field.
		Kushilevitz and N. Nisan, Communication Complexity, Cambridge 1997.
	www.wisdom.weizmann.ac.il /~naor/COURSE/complexity.html (445 words)

	Amazon.com: Communication Complexity and Parallel Computing: Books: Juraj Hromkovic (Site not responding. Last check: 2007-10-13)
		This book is devoted to the investigation of a special topic in theoretical computer science - communication complexity as an abstract measure of the complexity of computing problems.
		The author shows how to get important information about the parallel complexity (parallel time, the number of processors, the descriptional complexity of the topology of the parallel architecture) of specific computing problems from knowledge of their communication complexity.
		The book is written as a textbook for undergraduate and graduate students and provides a careful explanation of the subject as well as motivation for further research.
	www.amazon.com /Communication-Complexity-Parallel-Computing-Hromkovic/dp/354057459X (921 words)

Try your search on: Qwika (all wikis)