The counting complexity of a simple scheduling problem (Q1038110): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.orl.2009.05.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2032776320 / rank | |||
Normal rank |
Revision as of 01:19, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The counting complexity of a simple scheduling problem |
scientific article |
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