<--- Back to Details
First PageDocument Content
Combinatorial game theory / Complexity classes / PSPACE-complete / EXPTIME / Generalized geography / True quantified Boolean formula / Hot game / Kayles / Impartial game / Theoretical computer science / Mathematics / Computational complexity theory
Date: 2008-04-30 11:17:19
Combinatorial game theory
Complexity classes
PSPACE-complete
EXPTIME
Generalized geography
True quantified Boolean formula
Hot game
Kayles
Impartial game
Theoretical computer science
Mathematics
Computational complexity theory

Add to Reading List

Source URL: erikdemaine.org

Download Document from Source Website

File Size: 506,53 KB

Share Document on Facebook

Similar Documents

Theoretical computer science / Mathematical logic / Software engineering / Computability theory / Models of computation / Logic in computer science / Programming language semantics / Denotational semantics / Recursion / Negation / True quantified Boolean formula / Mathematical proof

An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

DocID: 1qnVV - View Document

Computational complexity theory / Complexity classes / Theory of computation / PPAD / Reduction / LemkeHowson algorithm / Algorithm / NP / PSPACE-complete / P / True quantified Boolean formula

The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.

DocID: 1q2Cn - View Document

Mathematics / Mathematical logic / Theoretical computer science / Automated theorem proving / Boolean algebra / Logic programming / Resolution / True quantified Boolean formula / Clause / Conflict-Driven Clause Learning / DPLL algorithm

Preprocessing Techniques for QBFs Enrico Giunchiglia1 , Paolo Marin1 , and Massimo Narizzano1 DIST - Universit`a di Genova Viale Causa 13, 16145 Genova, Italy Abstract

DocID: 1pPHH - View Document

Logic in computer science / Boolean algebra / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / True quantified Boolean formula / Maximum satisfiability problem / Model checking / Conjunctive normal form / Satisfiability / Tseytin transformation

Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2

DocID: 1pF7O - View Document

Automated theorem proving / Boolean algebra / Logic programming / Resolution / True quantified Boolean formula / Clause / Conflict-Driven Clause Learning / DPLL algorithm

Preprocessing Techniques for QBFs Enrico Giunchiglia1 , Paolo Marin1 , and Massimo Narizzano1 DIST - Universit`a di Genova Viale Causa 13, 16145 Genova, Italy Abstract

DocID: 1pv9j - View Document