DTIME - PDFSEARCH.IO - Document Search Engine

DTIME
Results: 4

#	Item
1	Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas Ryan Williams∗ Carnegie Mellon University Abstract Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2008-04-30 19:50:48 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
2	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 Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2012-12-14 16:46:25 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
3	Computational Complexity September[removed] Add to Reading List Source URL: www.daimi.au.dk Language: English - Date: 2006-09-13 07:14:43 Complexity classes P/poly P Advice DTIME EXPTIME Theoretical computer science Computational complexity theory Applied mathematics
4	PDF Document Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - 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

UPDATE