Back to Results
First PageMeta Content
Complexity classes / Decision problem / P versus NP problem / NP-complete / NP / Polynomial / Boolean satisfiability problem / Time complexity / 2-satisfiability / Theoretical computer science / Computational complexity theory / Applied mathematics


Document Date: 2008-02-01 12:23:22

Open Document

File Size: 207,16 KB

Share Result on Facebook

City

Amsterdam / London / New York / Redmond / /

Company

ABSTRACT We / Microsoft / G. Within / Computer Sciences / /

Country

United States / Netherlands / /

Currency

USD / /

Facility

University of California / /

IndustryTerm

polynomial-time algorithm / exponential-time algorithm / search problem / polynomial time algorithm / /

Organization

London Math Society / National Science Foundation / National Academy of Sciences / University of California / San Diego / /

Person

MICHAEL H. FREEDMAN / Hugh Woodin / Sam Buss / /

/

ProvinceOrState

New York / California / Washington / /

Technology

http / polynomial time algorithm / polynomial-time algorithm / exponential-time algorithm / /

URL

www.pnas.org / /

SocialTag