The counting complexity of a simple scheduling problem (Q1038110): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting and enumeration complexity with application to multicriteria scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Enumeration and Reliability Problems / rank | |||
Normal rank | |||
Latest revision as of 05:13, 2 July 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
0 references
0 references
