Login / Signup
Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization.
Pontus Ekberg
Wang Yi
Published in:
RTSS (2015)
Keyphrases
</>
conp complete
np complete
data complexity
data sets
sufficient conditions