The complexity of counting Eulerian tours in 4-regular graphs (Q2429360)
From MaRDI portal
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting Eulerian tours in 4-regular graphs |
No description defined |
Statements
The complexity of counting Eulerian tours in 4-regular graphs (English)
0 references
26 April 2012
0 references
Eulerian tours
0 references
A-trails
0 references
\#P-complete
0 references
AP-reduction
0 references
fully polynomial randomized approximation scheme
0 references
