Pages that link to "Item:Q1386936"
From MaRDI portal
The following pages link to On the complexity of some partition problems (Q1386936):
Displaying 20 items.
- Tractability frontiers of the partner units configuration problem (Q269477) (← links)
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- Two-Dimensional partitioning problems (Q671423) (← links)
- ``NP\(=\)P?'' and restricted partitions (Q799370) (← links)
- On the nearest product of partitions (Q808258) (← links)
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- A comment on \('''NP=P?'\) and restricted partitions'' (Q1083850) (← links)
- The parallel complexity of coarsest set partition problems (Q1198030) (← links)
- Reduction of the three-partition problem (Q1304381) (← links)
- On the complexity of assembly partitioning (Q1313730) (← links)
- Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences (Q1597685) (← links)
- Well-solvable instances for the partition problem (Q2371107) (← links)
- On the complexity of the partner units decision problem (Q2407462) (← links)
- (Q3188969) (← links)
- (Q3368883) (← links)
- Open Problems in Partition Regularity (Q4655901) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)
- (Q5146089) (← links)
- Relaxed complete partitions: an error-correcting Bachet's problem (Q5384252) (← links)