skip to content
A mildly exponential approximation algorithm for the permanent Preview this item
ClosePreview this item
Checking...

A mildly exponential approximation algorithm for the permanent

Author: Mark Jerrum; Umesh Virkumar Vazirani
Publisher: Edinburgh : University of Edinburgh, Dept. of Computer Science, Laboratory for Foundations of Computer Science, ©1991.
Series: University of Edinburgh.; Laboratory for Foundations of Computer Science.; LFCS report series
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "A new approximation algorithm for the permanent of an n x n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n[superscript 1/2] log²n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form e[superscipt theta(n)]."
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: Mark Jerrum; Umesh Virkumar Vazirani
OCLC Number: 25393575
Notes: "October 1991."
Description: 10 p. ; 21 cm.
Series Title: University of Edinburgh.; Laboratory for Foundations of Computer Science.; LFCS report series
Responsibility: Mark Jerrum and Umesh Vazirani.

Abstract:

Abstract: "A new approximation algorithm for the permanent of an n x n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n[superscript 1/2] log²n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form e[superscipt theta(n)]."

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/25393575>
library:oclcnum"25393575"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/25393575>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:copyrightYear"1991"
schema:creator
schema:datePublished"1991"
schema:description"Abstract: "A new approximation algorithm for the permanent of an n x n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n[superscript 1/2] log²n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity of the form e[superscipt theta(n)].""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/476306363>
schema:inLanguage"en"
schema:name"A mildly exponential approximation algorithm for the permanent"@en
schema:numberOfPages"10"
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.