An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs |
scientific article; zbMATH DE number 5843651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs |
scientific article; zbMATH DE number 5843651 |
Statements
An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (English)
0 references
2 February 2011
0 references
Hamiltonian cycle
0 references
1-factor
0 references
counting
0 references
\#P-complete
0 references
0 references
0 references
0.8847777247428894
0 references
0.8237119317054749
0 references
0.8031895160675049
0 references
0.7973195314407349
0 references
