On the co-NP-Completeness of the Zonotope Containment Problem

2021 ◽  
Author(s):  
Adrian Kulmburg ◽  
Matthias Althoff
Keyword(s):  
Containment Problem ◽  
Np Completeness

scholarly journals NP-completeness and degree restricted spanning trees

1992 ◽  
Vol 105 (1-3) ◽  
pp. 41-47 ◽  
Author(s):  
Robert James Douglas
Keyword(s):  
Spanning Trees ◽  
Np Completeness

The NP-Completeness of Some Edge-Partition Problems

1981 ◽  
Vol 10 (4) ◽  
pp. 713-717 ◽  
Author(s):  
Ian Holyer
Keyword(s):  
Np Completeness ◽  
Edge Partition

ON THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAY AND CONTENTION

1995 ◽  
Vol 05 (03) ◽  
pp. 331-341 ◽  
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.

scholarly journals Max NP-completeness made easy

1999 ◽  
Vol 225 (1-2) ◽  
pp. 65-79 ◽  
Author(s):  
Pierluigi Crescenzi ◽  
Luca Trevisan
Keyword(s):  
Np Completeness
Sign in / Sign up

Export Citation Format

Share Document