A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jacm/JerrumSV04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jacm/JerrumSV04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alistair_Sinclair
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Eric_Vigoda
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mark_Jerrum
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1008731.1008738
>
foaf:
homepage
<
https://doi.org/10.1145/1008731.1008738
>
dc:
identifier
DBLP journals/jacm/JerrumSV04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1008731.1008738
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jacm
>
rdfs:
label
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alistair_Sinclair
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Eric_Vigoda
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mark_Jerrum
>
swrc:
number
4
(xsd:string)
swrc:
pages
671-697
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jacm/JerrumSV04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jacm/JerrumSV04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jacm/jacm51.html#JerrumSV04
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1008731.1008738
>
dc:
subject
Markov chain Monte Carlo, permanent of a matrix, rapidly mixing Markov chains
(xsd:string)
dc:
title
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
51
(xsd:string)