| dc.contributor.author | Díaz Cort, Josep |
| dc.contributor.author | Serna Iglesias, María José |
| dc.contributor.author | Spirakis, Paul George |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
| dc.date.accessioned | 2016-01-29T14:13:01Z |
| dc.date.available | 2016-01-29T14:13:01Z |
| dc.date.issued | 1995-04 |
| dc.identifier.citation | Diaz, J., Serna, M., Spirakis, P.G. "Approximating the permanent is in RNC". 1995. |
| dc.identifier.uri | http://hdl.handle.net/2117/82290 |
| dc.description.abstract | In 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.extent | 22 p. |
| dc.language.iso | eng |
| dc.subject | Àrees temàtiques de la UPC::Informàtica |
| dc.subject.other | Parallelization |
| dc.subject.other | Markov chain |
| dc.subject.other | RNC |
| dc.title | Approximating the permanent is in RNC |
| dc.type | External research report |
| dc.rights.access | Open Access |
| local.identifier.drac | 514992 |
| dc.description.version | Postprint (published version) |
| local.citation.author | Diaz, J.; Serna, M.; Spirakis, P.G. |
