<--- Back to Details
First PageDocument Content
NP-complete problems / Complexity classes / Vertex cover / Graph theory / MAX-3SAT / Approximation algorithm / Graph coloring / Clique problem / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2010-03-18 10:25:26
NP-complete problems
Complexity classes
Vertex cover
Graph theory
MAX-3SAT
Approximation algorithm
Graph coloring
Clique problem
Time complexity
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: cs.nyu.edu

Download Document from Source Website

File Size: 447,68 KB

Share Document on Facebook

Similar Documents

Lebesgue density and Π01 Classes Mushfeq Khan University of Hawai‘i at M¯anoa Algorithmic Randomness and Complexity Shonan Village Center September 12th, 2014

DocID: 1ubuP - View Document

Rademacher Complexity Margin Bounds for Learning with a Large Number of Classes Vitaly Kuznetsov Courant Institute of Mathematical Sciences, 251 Mercer street, New York, NY, 10012 Mehryar Mohri

DocID: 1t1hx - View Document

Principles of metabolism: coping with complexity Six classes of enzymes

DocID: 1sh47 - View Document

Computational complexity theory / Logic / Complexity classes / Mathematical logic / PSPACE / FO / Second-order logic / P versus NP problem / Constraint satisfaction problem / NP / P / Constraint satisfaction

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

DocID: 1ruap - View Document

Computational complexity theory / Complexity classes / Theory of computation / FO / PSPACE / IP / NP / P / Reduction / Homomorphism / SO

The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University,

DocID: 1rtIQ - View Document