The counting complexity of a simple scheduling problem (Q1038110)
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: The counting complexity of a simple scheduling problem |
scientific article; zbMATH DE number 5634576
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The counting complexity of a simple scheduling problem |
scientific article; zbMATH DE number 5634576 |
Statements
The counting complexity of a simple scheduling problem (English)
0 references
17 November 2009
0 references
scheduling
0 references
counting
0 references
\#P-complete
0 references
computational complexity
0 references
polynomial interpolation
0 references
0 references
0 references
