Back to Results
First PageMeta Content
Complexity classes / NP-hardness / IP / PSPACE-complete / NP / Reduction / PSPACE / P / FO / Circuits over sets of natural numbers / True quantified Boolean formula


QCSP on partially reflexive forests Barnaby Martin Algorithms and Complexity in Durham, Durham University, U.K. CP 2011, Perugia. 14th August 2011.
Add to Reading List

Document Date: 2011-09-13 17:39:08


Open Document

File Size: 264,00 KB

Share Result on Facebook