<--- 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

Complexity classes / Models of computation / Computational resources / Alternating Turing machine / Operations research / Mathematical optimization / P / AMPL / Algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics

TE C H N I C A L R E P O R T ¨ I NFORMATIONSSYSTEME I NSTITUT F UR A BTEILUNG DATENBANKEN UND A RTIFICIAL I NTELLIGENCE

DocID: n8Cv - View Document

Applied mathematics / EXPSPACE / 2-EXPTIME / NP / Automated planning and scheduling / EXPTIME / Non-deterministic Turing machine / DSPACE / Alternating Turing machine / Theoretical computer science / Computational complexity theory / Complexity classes

PDF Document

DocID: 1isl - 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