Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / Mathematical optimization / Analysis of algorithms / NP-complete / P versus NP problem / NP-hard / NP / Bounded-error probabilistic polynomial / Theoretical computer science / Computational complexity theory / Applied mathematics


Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY EXERCISE SHEET 1: Turing machines
Add to Reading List

Document Date: 2013-10-08 12:31:35

Open Document

File Size: 1,74 MB

Share Result on Facebook

Company

CNF / /

/

IndustryTerm

boolean matrix product / explicit algorithm / na¨ıve algorithm / deterministic algorithm / non-trivial randomised and deterministic algorithms / fold product / /

Person

Ashley Montanaro / /

Position

current player / player / /

ProvinceOrState

New Foundland and Labrador / /

Technology

deterministic algorithm / explicit algorithm / randomised algorithm / na¨ıve algorithm / alternative non-trivial randomised and deterministic algorithms / /

SocialTag