Back to Results
First PageMeta Content
NP-complete problems / Complexity classes / Mathematical optimization / NP-complete / P versus NP problem / NP / Time complexity / Vertex cover / Hamiltonian path / Theoretical computer science / Computational complexity theory / Applied mathematics


UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m.
Add to Reading List

Document Date: 2015-01-21 19:48:42


Open Document

File Size: 64,28 KB

Share Result on Facebook

Company

Section Partners / Vertex / 3SAT / /

Currency

pence / USD / /

IndustryTerm

computing / /

MusicGroup

The Network / /

Organization

UC Berkeley / /

Person

Gold / Blue / David Wagner / /

Position

Professor / Lecturer / /

SocialTag