Back to Results
First PageMeta Content
Polygons / Euclidean plane geometry / 3D computer graphics / Simple polygon / PSPACE-complete / Vertex / Hex / True quantified Boolean formula / Polyhedron / Games / Geometry / Theoretical computer science


CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Partial Searchlight Scheduling is Strongly PSPACE-Complete Giovanni Viglietta∗ Abstract
Add to Reading List

Document Date: 2013-08-11 21:51:56

Open Document

File Size: 304,05 KB

Share Result on Facebook

City

Winnipeg / Waterloo / /

Company

SIAM Journal / /

Country

Italy / Canada / /

/

Event

Product Issues / /

Facility

University of Pisa / Carleton University / /

IndustryTerm

search schedule / cleverer tools / search heuristic / search space / /

Organization

School of Computer Science / PSPACE / University of Pisa / Carleton University / /

Position

author / guard / and hence can never be cleared / subsegment guard / first guard / pipe guard / guard / second guard / internal guard / /

Product

pipe / /

ProvinceOrState

Ontario / /

PublishedMedium

SIAM Journal on Computing / Theoretical Computer Science / /

Technology

laser / lasers / /

SocialTag