skip to content
On the Complexity of Designing Distributed Protocols. Preview this item
ClosePreview this item
Checking...

On the Complexity of Designing Distributed Protocols.

Author: Christos H Papadimitriou; John Tsitsiklis; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS.
Publisher: Ft. Belvoir Defense Technical Information Center NOV 1982.
Edition/Format:   Print book : EnglishView all editions and formats
Database:WorldCat
Summary:
We study the complexity of two problems of distributed computation and decision-making. We show that deciding whether two distant agents can arrive at compatible decisions without any communication one agent has three or more alternatives. We also show that minimizing the amount of communication necessary for the distributed computation of a function, when two distant computers receive each a part of the input, is  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Christos H Papadimitriou; John Tsitsiklis; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS.
OCLC Number: 227559510
Description: 10 p.

Abstract:

We study the complexity of two problems of distributed computation and decision-making. We show that deciding whether two distant agents can arrive at compatible decisions without any communication one agent has three or more alternatives. We also show that minimizing the amount of communication necessary for the distributed computation of a function, when two distant computers receive each a part of the input, is NP-complete. This proves a conjecture due to A. Yao. (Author).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227559510>
library:oclcnum"227559510"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"1982"
schema:datePublished"NOV 1982"
schema:description"We study the complexity of two problems of distributed computation and decision-making. We show that deciding whether two distant agents can arrive at compatible decisions without any communication one agent has three or more alternatives. We also show that minimizing the amount of communication necessary for the distributed computation of a function, when two distant computers receive each a part of the input, is NP-complete. This proves a conjecture due to A. Yao. (Author)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1909333786>
schema:inLanguage"en"
schema:name"On the Complexity of Designing Distributed Protocols."@en
schema:numberOfPages"10"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.