NEXPTIME - PDFSEARCH.IO - Document Search Engine

NEXPTIME
Results: 15

#	Item
11	PDF Document Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 04:10:57 Complexity classes Polynomial hierarchy PH NP P Stephen Cook NEXPTIME Oracle machine NC Theoretical computer science Computational complexity theory Applied mathematics
12	PDF Document Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2007-05-24 22:16:31 Complexity classes NP-complete P versus NP problem NP-hard NP Boolean satisfiability problem P Bounded-error probabilistic polynomial NEXPTIME Theoretical computer science Computational complexity theory Applied mathematics
13	PDF Document Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2008-03-13 15:36:52 Complexity classes Probabilistically checkable proof Interactive proof system NP NEXPTIME P versus NP problem IP P Clique problem Theoretical computer science Computational complexity theory Applied mathematics
14	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
15	PDF Document Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-08-29 07:20:33 Applied mathematics Distance-bounding protocol IP NEXPTIME Formal verification Alice and Bob Public-key cryptography Man-in-the-middle attack Interactive proof system Cryptography Cryptographic protocols Theoretical computer science