<--- Back to Details
First PageDocument Content
Computational complexity theory / Complexity classes / Theory of computation / FO / PSPACE / SO / P / EXPTIME / Boolean algebra / Co-NP-complete / Reduction / Descriptive complexity theory
Date: 2009-08-14 00:50:42
Computational complexity theory
Complexity classes
Theory of computation
FO
PSPACE
SO
P
EXPTIME
Boolean algebra
Co-NP-complete
Reduction
Descriptive complexity theory

Introduction & Motivation Relations and Operations Boolean and 3-element cases

Add to Reading List

Source URL: www.bedewell.com

Download Document from Source Website

File Size: 514,13 KB

Share Document on Facebook

Similar Documents

Bruce Plante, Tulsa World / Courtesy of AAEC Draw your own conclusions Study the drawing and add a caption to this wordless cartoon. There is no wrong answer, so just be creative!

DocID: 1xVYx - View Document

Kirkus Reviews / Irene / Literature

She sighed, dramatically. “You talk so weird sometimes. I hate it.”. “You hate it?” I got up and walked over to the TV. Rising to my tiptoesStanding on tiptoe, I peered behind it. I spotted the postcard amid ast

DocID: 1xVUC - View Document

#ÚĸÀńè ƋƋ¬őģèŌèőƣƑ śþþèƋƑ ĸƣƑ śǁő ƣǁĸƑƣ śő ËèńèÀƋ¬ƣĸőģ ¬őÚ ģĸþƣĸőģŶ u6# Ė ï?£Å?M?ēÊX±£ ŠBɂmÌ

DocID: 1xVQg - View Document

Films / Literature / Dimension / Culture / Geometry / Flatland / Triangle geometry / Spaceland / Triangle / Flatland: The Movie

1. Of the Nature of Flatland. I call our world Flatland, not because we call it so, but to make its nature clearer to you, my happy readers, who are privileged to live in Space. Imagine a vast sheet of paper on which str

DocID: 1xVMR - View Document