Shuffle Product and Directed Bandwidth are XNLP-complete, settling open questions and implying parameterized hardness for scheduling with precedence delays.
Journal of Computer and System Sciences10(3), 384–393 (1975)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
Shuffle Product and Directed Bandwidth are XNLP-complete, settling open questions and implying parameterized hardness for scheduling with precedence delays.