NTIME - PDFSEARCH.IO - Document Search Engine

NTIME
Results: 20

#	Item
11	Dataset Name Dimension Long Name(attr) Add to Reading List Source URL: ozoneaq.gsfc.nasa.gov Language: English - Date: 2014-07-28 09:56:51 Environmental chemistry Complexity classes Oxygen NTIME Ozone Ultraviolet Chemistry Applied mathematics Ozone depletion
12	How to Run Turing Machines on Encrypted Data Shafi Goldwasser? Yael Kalai† Raluca Ada Popa? ./ Vinod Vaikuntanathan Add to Reading List Source URL: web.mit.edu Language: English - Date: 2014-09-26 19:20:42 Turing machine Computability theory Models of computation Alan Turing Homomorphic encryption Computability Advice NTIME EXPTIME Theoretical computer science Applied mathematics Complexity classes
13	Classification of computational problems Pavel Pudlák Mathematical Institute, Academy of Sciences, Prague FJFI, [removed] Add to Reading List Source URL: kolokvium.fjfi.cvut.cz Language: English - Date: 2014-04-09 11:50:42 Applied mathematics NP P versus NP problem Polynomial EXPTIME P NTIME NP-hard IP Theoretical computer science Computational complexity theory Complexity classes
14	Élégant, I R NTIME PARFAITEMENT Add to Reading List Source URL: www.clossaintlouis.com Language: French - Date: 2009-04-01 10:44:41
15	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
16	In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time Russell Impagliazzo∗ Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2003-11-18 15:48:52 Complexity classes Computational resources Pseudorandomness Analysis of algorithms Advice Bounded-error probabilistic polynomial NTIME Pseudorandom generator Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics
17	Non-Uniform ACC Circuit Lower Bounds Ryan Williams∗ IBM Almaden Research Center Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2010-11-23 15:55:39 Complexity classes Circuit complexity ACC0 Time complexity PP NTIME P AC Natural proof Theoretical computer science Computational complexity theory Applied mathematics
18	PDF Document Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2012-07-31 20:46:00 Complexity classes Circuit complexity ACC0 NTIME Cook–Levin theorem PP Natural proof NP-complete Time complexity Theoretical computer science Computational complexity theory Applied mathematics
19	PDF Document Add to Reading List Source URL: www-mgi.informatik.rwth-aachen.de Language: English - Date: 2008-01-03 05:43:35 Finite model theory Universal algebra Complexity classes Descriptive complexity Structure FO NTIME Arity Second-order logic Theoretical computer science Computational complexity theory Mathematics
20	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