Back to Results
First PageMeta Content
NP / Time complexity / P / FL / FO / Turing machine / Computational complexity theory / Theoretical computer science / Applied mathematics / Complexity classes


UNIVERSITY OF CALIFORNIA, RIVERSIDE DEPARTMENT OF COMPUTER SCIENCE 2006 DEPTH EXAMINATION IN THEORY OF OF COMPUTATION AND ALGORITHMS • There are 10 problems on the test. Each problem is worth 10 points. The ordering o
Add to Reading List

Document Date: 2007-02-09 21:58:07


Open Document

File Size: 61,90 KB

Share Result on Facebook

Facility

UNIVERSITY OF CALIFORNIA / /

IndustryTerm

pseudo-polynomial time algorithm / linear-time algorithm / /

OperatingSystem

L3 / /

Organization

UNIVERSITY OF CALIFORNIA / RIVERSIDE DEPARTMENT OF COMPUTER SCIENCE / /

ProvinceOrState

M. b. / California / /

Technology

2006 DEPTH EXAMINATION IN THEORY OF OF COMPUTATION AND ALGORITHMS / pseudo-polynomial time algorithm / following Reverse-Delete algorithm / linear-time algorithm / /

SocialTag