The complexity of counting Eulerian tours in 4-regular graphs (Q2429360): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
Revision as of 15:34, 2 May 2024
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
