Completeness in the Polynomial-Time Hierarchy A Compendium∗ Marcus Schaefer

First Page		Document Content
Date: 2008-10-05 12:49:10 Boolean algebra Logic in computer science NP-complete problems Combinatorics Boolean satisfiability problem Electronic design automation Conjunctive normal form Partition True quantified Boolean formula Theoretical computer science Mathematics Computational complexity theory		Completeness in the Polynomial-Time Hierarchy A Compendium∗ Marcus Schaefer Add to Reading List Source URL: ovid.cs.depaul.edu Download Document from Source Website File Size: 285,08 KB Share Document on Facebook

	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning” DocID: 1qJex - View Document
	Microsoft Word - IBSdoc DocID: 1qERD - View Document
	Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc DocID: 1qzAi - View Document
	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk DocID: 1qorC - View Document