<--- Back to Details
First PageDocument Content
Complexity classes / Time hierarchy theorem / NTIME / DTIME / DSPACE / NSPACE / Space hierarchy theorem / Alternating Turing machine / EXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2010-04-22 22:13:45
Complexity classes
Time hierarchy theorem
NTIME
DTIME
DSPACE
NSPACE
Space hierarchy theorem
Alternating Turing machine
EXPTIME
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: ftp.cs.rutgers.edu

Download Document from Source Website

File Size: 336,67 KB

Share Document on Facebook

Similar Documents

Complexity classes / True quantified Boolean formula / Alternating Turing machine / FO / DTIME / NTIME / Time complexity / SL / Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics

Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas Ryan Williams∗ Carnegie Mellon University Abstract

DocID: 17SeJ - View Document

Computability theory / Computational complexity theory / Computational resources / Models of computation / Linear speedup theorem / Universal Turing machine / Speedup theorem / DTIME / Time complexity / Theoretical computer science / Applied mathematics / Turing machine

C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2012, Article 07, pages 1–24 http://cjtcs.cs.uchicago.edu/ Computational Models with No Linear Speedup Amir M. Ben-Amram

DocID: 14t6w - View Document

Complexity classes / P/poly / P / Advice / DTIME / EXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics

Computational Complexity September[removed]

DocID: 1Kpu - View Document

Complexity classes / Time hierarchy theorem / NTIME / DTIME / DSPACE / NSPACE / Space hierarchy theorem / Alternating Turing machine / EXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics

PDF Document

DocID: FLL - View Document