Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly coNP-complete Pontus Ekberg - Pontus - Document - PDFSEARCH.IO

First Page	Meta Content
	Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly coNP-complete Pontus Ekberg & Wang Yi Uppsala University ECRTS 2015 Add to Reading List Document Date: 2015-08-21 05:44:10 Open Document File Size: 594,49 KB Share Result on Facebook

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly coNP-complete Pontus Ekberg & Wang Yi Uppsala University ECRTS 2015Add to Reading List