Show simple item record

dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorSerna Iglesias, María José
dc.contributor.authorSpirakis, Paul George
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-01-29T14:13:01Z
dc.date.available2016-01-29T14:13:01Z
dc.date.issued1995-04
dc.identifier.citationDiaz, J., Serna, M., Spirakis, P.G. "Approximating the permanent is in RNC". 1995.
dc.identifier.urihttp://hdl.handle.net/2117/82290
dc.description.abstractIn this work we look into the parallelization (in the NC sense) of the Markov Chain approach to almost random generation, as described by Sinclair (1993). We give a RNC almost uniform generator for perfect matchings in dense bipartite graphs, and its RNC reduction to its counting problem. As a consequence we can classify the problem of getting an approximation scheme to the permanent of a boolean matrix in RNC. We also state other problems for which the same technique applies.
dc.format.extent22 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherParallelization
dc.subject.otherMarkov chain
dc.subject.otherRNC
dc.titleApproximating the permanent is in RNC
dc.typeExternal research report
dc.rights.accessOpen Access
drac.iddocument514992
dc.description.versionPostprint (published version)
upcommons.citation.authorDiaz, J., Serna, M., Spirakis, P.G.
upcommons.citation.publishedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder