Circuits over sets of natural numbers

#	Item
1	Equivalence Problems for Circuits over Sets of Natural Numbers Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen Travers, and Matthias Waldherr Universit¨ at W¨ Add to Reading List Source URL: pdfs.semanticscholar.org - Date: 2015-12-07 11:30:45
2	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 Source URL: www.bedewell.com Language: English - Date: 2011-09-13 17:39:08 Complexity classes NP-hardness IP PSPACE-complete NP Reduction PSPACE P FO Circuits over sets of natural numbers True quantified Boolean formula