Back to Results
First PageMeta Content
Complexity classes / Mathematical optimization / Structural complexity theory / Computability theory / NP-hard / NP-complete / Boolean satisfiability problem / Cook–Levin theorem / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but
Add to Reading List

Document Date: 2014-12-28 09:03:23

Open Document

File Size: 1,48 MB

Share Result on Facebook

City

Moscow / /

Company

3SAT / Vertex / Cobham / /

Country

United States / Soviet Union / /

Currency

USD / /

Facility

Moscow University / /

IndustryTerm

linear time using depth-first search / clever algorithm / black steel box / time using depth-first-search / nondeterministic polynomial-time algorithm / polynomial-time algorithm / mythical algorithm / /

Organization

Congress / MIT / Moscow University / Clay Mathematics Institute / /

Person

John von Neumann / Jack Edmonds / Michael Rabin / Steve Cook / Kurt Gödel / Grace Murray Hopper / Jeff Erickson / Shimon Peres / Leonid Levin / Tom Waits / David Rumsfeld / Alan Cobham / Turing / /

Position

single-head / Critic / salesman / player / /

PublishedMedium

Philosophy of Science / /

Technology

nondeterministic polynomial-time algorithm / 3 Algorithms / clever algorithm / 9 Algorithms / RAM algorithms / 8 Algorithms / 2 Algorithms / polynomial-time algorithm / 1 Algorithms / 7 Algorithms / simulation / mythical algorithm / 5 Algorithms / 6 Algorithms / 4 Algorithms / /

URL

http /

SocialTag