Alternating Turing machine - PDFSEARCH.IO - Document Search Engine

Alternating Turing machine
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	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 Add to Reading List Source URL: www.dbai.tuwien.ac.at Language: English - Date: 2009-05-11 12:19:26 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
3	PDF Document Add to Reading List Source URL: www.informatik.uni-freiburg.de Language: English - Date: 2003-05-27 08:56:44 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
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