Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Mathematical optimization / Structural complexity theory / Parameterized complexity / P versus NP problem / NP-complete / NP-hard / NP / Theoretical computer science / Computational complexity theory / Applied mathematics


Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1
Add to Reading List

Document Date: 2009-10-05 20:05:44

Open Document

File Size: 173,30 KB

Share Result on Facebook

City

Durham / /

Company

3SAT / Vertex / /

Country

Australia / /

Currency

USD / /

/

Facility

Institute of Advanced Study / University of Newcastle / Durham University / Durham University Institute / Grey College / University of Newcastle Parameterized Complexity Research Unit / /

IndustryTerm

polynomial-time algorithms / polynomial time constant factor approximation algorithm / partial algorithms / implicit genetic algorithm / type-checking algorithm / trivial linear time algorithm / computing / /

OperatingSystem

XP / /

Organization

Newcastle Parameterized Complexity Research Unit / Grey College / Durham University Institute for Advanced Studies / High Anglican Church / Institute of Advanced Study / Australian Research Council / Australian Centre for Bioinformatics / University of Newcastle / Durham University / /

Person

Bill Gasarch / Ron Fagin / /

Position

Deputy Vice-Chancellor for Research / mathematical culture head / elementary school / /

ProgrammingLanguage

ML / /

Technology

trivial linear time algorithm / FPT algorithm / cryptography / Ptime algorithms / Bioinformatics / type-checking algorithm / implicit genetic algorithm / FPT algorithms / polynomial-time algorithms / polynomial time constant factor approximation algorithm / 2-coloring algorithm / /

SocialTag