| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652665 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
Abstract
We classify into polynomial time or NP-complete all three nonempty part sandwich problems. This solves the polynomial dichotomy for this class of problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
