Nondeterminism and NP-Completeness

Texts in Computer Science - Computability and Complexity Theory ◽

10.1007/978-1-4757-3544-4_6 ◽

2001 ◽

pp. 122-144

Author(s):

Steven Homer ◽

Alan L. Selman

Keyword(s):

Np Completeness

Download Full-text

NP-Completeness of Fill-a-Pix and ΣP2-Completeness of Its Fewest Clues Problem

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e102.a.1490 ◽

2019 ◽

Vol E102.A (11) ◽

pp. 1490-1496

Author(s):

Yuta HIGUCHI ◽

Kei KIMURA

Keyword(s):

Np Completeness

Download Full-text

NP-completeness and degree restricted spanning trees

Discrete Mathematics ◽

10.1016/0012-365x(92)90130-8 ◽

1992 ◽

Vol 105 (1-3) ◽

pp. 41-47 ◽

Cited By ~ 34

Author(s):

Robert James Douglas

Keyword(s):

Spanning Trees ◽

Np Completeness

Download Full-text

The NP-Completeness of Some Edge-Partition Problems

SIAM Journal on Computing ◽

10.1137/0210054 ◽

1981 ◽

Vol 10 (4) ◽

pp. 713-717 ◽

Cited By ~ 133

Author(s):

Ian Holyer

Keyword(s):

Np Completeness ◽

Edge Partition

Download Full-text

ON THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAY AND CONTENTION

Parallel Processing Letters ◽

10.1142/s012962649500031x ◽

1995 ◽

Vol 05 (03) ◽

pp. 331-341 ◽

Cited By ~ 4

Author(s):

MICHAEL G. NORMAN ◽

SUSANNA PELAGATTI ◽

PETER THANISCH

Keyword(s):

Execution Time ◽

Communication Delay ◽

Interprocessor Communication ◽

Communication Latency ◽

Processor Scheduling ◽

Np Completeness

We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completeness of two processor scheduling with unit execution time tasks in our model.

Download Full-text