Back to Results
First PageMeta Content
Complexity classes / NP-hard / NP-complete / NP / P versus NP problem / P / Reduction / Decision problem / Oracle machine / Theoretical computer science / Computational complexity theory / Applied mathematics


Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions
Add to Reading List

Document Date: 2008-09-30 17:00:23

Open Document

File Size: 133,91 KB

Share Result on Facebook

Facility

Carnegie-Mellon University / University of Alberta / University of Waterloo / California State University / University of Cambridge / /

IndustryTerm

deterministic polynomial solution / given solution / polynomial solutions / polynomial solution / possible solutions / correct solution / search problems / algorithmic solution / deterministic polynomial algorithm / /

Organization

California State University / Chico / Carnegie-Mellon University / University of Waterloo / University of Alberta / University of Cambridge / /

Person

Steven Rudich / /

Position

Travelling Salesman / /

ProgrammingLanguage

TSP / /

ProvinceOrState

Alberta / /

Technology

aforementioned algorithm / deterministic polynomial algorithm / pseudohalting-problem algorithm / artificial intelligence / same algorithm / /

URL

http /

SocialTag