skip to content
The probabilistic method yields deterministic parallel algorithms Preview this item
ClosePreview this item
Checking...

The probabilistic method yields deterministic parallel algorithms

Author: Rajeev Motwani; Joseph Naor; Moni Naor
Publisher: Yorktown Heights, N.Y. : IBM Research Division, [1989]
Series: International Business Machines Corporation.; Research Division.; Research report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "We present a technique for converting RNC algorithms into NC algorithms. Our approach is based on a parallel implementation of the method of conditional probabilities. This method was used to convert probabilistic proofs of existence of combinatorial structures into polynomial time deterministic algorithms. It has the apparent drawback of being extremely sequential in nature. We show certain general
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: Rajeev Motwani; Joseph Naor; Moni Naor
OCLC Number: 23717964
Notes: Cover title.
"11/29/89."
Description: 38 p. ; 28 cm.
Series Title: International Business Machines Corporation.; Research Division.; Research report
Responsibility: Rajeev Motwani, Joseph Naor, and Moni Naor.

Abstract:

Abstract: "We present a technique for converting RNC algorithms into NC algorithms. Our approach is based on a parallel implementation of the method of conditional probabilities. This method was used to convert probabilistic proofs of existence of combinatorial structures into polynomial time deterministic algorithms. It has the apparent drawback of being extremely sequential in nature. We show certain general conditions under which it is possible to use this technique for devising deterministic parallel algorithms. We use our technique to devise an NC algorithm for the set balancing problem."

This problem turns out to be a useful tool for parallel algorithms. Using our de-randomization method and the set balancing algorithm, we provide an NC algorithm for the lattice approximation problem. We also use the lattice approximation problem to bootstrap the set balancing algorithm, and the result is a more processor efficient algorithm. Other applications are also discussed."

Reviews

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

Tags

Be the first.

Similar Items

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/23717964>
library:oclcnum"23717964"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/23717964>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1989"
schema:description"This problem turns out to be a useful tool for parallel algorithms. Using our de-randomization method and the set balancing algorithm, we provide an NC algorithm for the lattice approximation problem. We also use the lattice approximation problem to bootstrap the set balancing algorithm, and the result is a more processor efficient algorithm. Other applications are also discussed.""@en
schema:description"Abstract: "We present a technique for converting RNC algorithms into NC algorithms. Our approach is based on a parallel implementation of the method of conditional probabilities. This method was used to convert probabilistic proofs of existence of combinatorial structures into polynomial time deterministic algorithms. It has the apparent drawback of being extremely sequential in nature. We show certain general conditions under which it is possible to use this technique for devising deterministic parallel algorithms. We use our technique to devise an NC algorithm for the set balancing problem.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/25057568>
schema:inLanguage"en"
schema:name"The probabilistic method yields deterministic parallel algorithms"@en
schema:numberOfPages"38"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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