EXPTIME - PDFSEARCH.IO - Document Search Engine

EXPTIME
Results: 32

#	Item
21	An ExpTime Tableau-based Decision Procedure for ALCQI Yu Ding and Volker Haarslev Concordia University, Montreal, Canada 1 Add to Reading List Source URL: www.ceur-ws.org Language: English - Date: 2007-05-22 01:39:22 Electronic design automation Formal methods Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Algebraic structure Decision problem Algebra Mathematics Theoretical computer science Mathematical logic
22	How to Run Turing Machines on Encrypted Data Shafi Goldwasser⋆ Yael Kalai† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-06-09 00:24:22 Turing machine Computability theory Models of computation Alan Turing Homomorphic encryption Computability Advice NTIME EXPTIME Theoretical computer science Applied mathematics Complexity classes
23	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
24	COMPLEXITY AND COMPLETENESS OF FINDING ANOTHER SOLUTION AND ITS APPLICATION TO PUZZLES Add to Reading List Source URL: www-imai.is.s.u-tokyo.ac.jp Language: English - Date: 2003-05-03 02:38:34 Applied mathematics NP-complete P versus NP problem EXPTIME PSPACE-complete NP P-complete P Reduction Theoretical computer science Computational complexity theory Complexity classes
25	PDF Document Add to Reading List Source URL: cse.unl.edu Language: English - Date: 2008-07-31 09:53:05 Complexity classes Advice P/poly Padding argument Bounded-error probabilistic polynomial Polynomial hierarchy Circuit complexity PP EXPTIME Theoretical computer science Computational complexity theory Applied mathematics
26	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
27	PDF Document Add to Reading List Source URL: ovid.cs.depaul.edu Language: English - Date: 2010-08-20 13:53:08 Applied mathematics Crossing number NP Existential theory of the reals Intersection graph EXPTIME P versus NP problem Graph isomorphism problem Theoretical computer science Computational complexity theory Complexity classes
28	PDF Document Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-05-13 09:39:02 Complexity classes NP P versus NP problem Interactive proof system Oracle machine P Bounded-error probabilistic polynomial NEXPTIME EXPTIME Theoretical computer science Computational complexity theory Applied mathematics
29	PDF Document Add to Reading List Source URL: erikdemaine.org Language: English - Date: 2008-04-30 11:17:19 Combinatorial game theory Complexity classes PSPACE-complete EXPTIME Generalized geography True quantified Boolean formula Hot game Kayles Impartial game Theoretical computer science Mathematics Computational complexity theory
30	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