Partial Searchlight Scheduling is Strongly PSPACE-Complete Giovanni Viglietta∗ all possible schedules has been shown to be discretizable and reducible to a finite graph, which can be explored systematically to find a s - PSPACE - Document - PDFSEARCH.IO

First Page	Meta Content
	Partial Searchlight Scheduling is Strongly PSPACE-Complete Giovanni Viglietta∗ all possible schedules has been shown to be discretizable and reducible to a finite graph, which can be explored systematically to find a s Add to Reading List Document Date: 2013-06-13 22:40:09 Open Document File Size: 291,78 KB Share Result on Facebook

Partial Searchlight Scheduling is Strongly PSPACE-Complete Giovanni Viglietta∗ all possible schedules has been shown to be discretizable and reducible to a finite graph, which can be explored systematically to find a sAdd to Reading List