Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / Models of computation / Mathematical optimization / NP-complete / NP / P versus NP problem / Oracle machine / P / Theoretical computer science / Computational complexity theory / Applied mathematics


The Computational Complexity Column by Lance FORTNOW
Add to Reading List

Document Date: 2003-08-12 11:21:33


Open Document

File Size: 218,35 KB

Share Result on Facebook

City

Independence Way Princeton / Boston / Princeton / /

Company

Cobham / FORTNOW NEC Laboratories America / /

Country

United States / Soviet Union / /

Currency

USD / /

/

Facility

University of Aarhus / Moscow State University / Clay Mathematics Institute / Computational Complexity Lance Fortnow1 NEC Research Institute / Steve Homer2 Computer Science Department Boston University / /

IndustryTerm

propositional proof systems / possible solution / conference web page http /

Organization

Moscow State University / University of Aarhus / Harvard / Clay Mathematics Institute / Boston University / Computational Complexity Lance Fortnow1 NEC Research Institute / /

Person

Rabin / Steve Homer / Richard Karp / John Dawson / Aki Kanamori / Leonid Levin / Dirk van Dalen / Stephen Cook / /

Position

model / theoretical computational model / tape head / theoretical model for computation / salesman / /

ProvinceOrState

New Jersey / New Foundland and Labrador / Massachusetts / /

Technology

polynomial-time algorithm / usually using approximation algorithms / deterministic algorithm / /

URL

http /

SocialTag