NEXPTIME

Results: 15



#Item
1Complexity classes / PSPACE-complete / IP / Generalized geography / PSPACE / PP / ArthurMerlin protocol / Computational complexity theory / NP / P / NEXPTIME / Reduction

1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2001-10-24 10:52:24
2NEXPTIME

Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, Query Answering in the Description Logic S ⋆ Meghyn Bienvenu1 , Thomas Eiter2 , Carsten Lutz1 , 2 ˇ

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2010-04-20 14:40:19
    3Complexity classes / NTIME / Circuit complexity / P / Bounded-error probabilistic polynomial / Cook–Levin theorem / Time hierarchy theorem / NEXPTIME / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

    A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams†

    Add to Reading List

    Source URL: arxiv.org

    Language: English - Date: 2011-11-07 20:15:16
    4NEXPTIME / IP / NP / Soundness / KeY / Logic programming / Interactive proof system / Zero-knowledge proof / Theoretical computer science / Applied mathematics / Complexity classes

    Interactive proofs with competing teams of no-signaling provers

    Add to Reading List

    Source URL: cjtcs.cs.uchicago.edu

    Language: English - Date: 2013-07-24 10:11:20
    5Quantum information science / Complexity classes / Interactive proof system / QMA / NEXPTIME / IP / Probabilistically checkable proof / Qubit / Quantum computer / Theoretical computer science / Applied mathematics / Computational complexity theory

    A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract

    Add to Reading List

    Source URL: www.quantum-lab.org

    Language: English - Date: 2014-11-28 23:31:17
    6Quantum mechanics / Quantum teleportation / Interactive proof system / Quantum entanglement / Quantum channel / IP / NEXPTIME / Quantum key distribution / Qubit / Physics / Theoretical computer science / Quantum information science

    Coherent state exchange in multi-prover quantum interactive proof systems

    Add to Reading List

    Source URL: cjtcs.cs.uchicago.edu

    Language: English - Date: 2013-08-13 18:53:20
    7Computational complexity theory / Interactive proof system / NEXPTIME / Probabilistically checkable proof / IP / Cryptographic protocols / Soundness / NP / Zero-knowledge proof / Theoretical computer science / Applied mathematics / Complexity classes

    How to Delegate Computations: The Power of No-Signaling Proofs Yael Tauman Kalai ∗

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2015-05-01 02:12:54
    8Probabilistic complexity theory / Complexity classes / Mathematical optimization / Probabilistically checkable proof / PCP theorem / NP / NEXPTIME / Hardness of approximation / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics

    The Tale of the PCP Theorem How the search for the limits of computing led to the discovery of the unexpected power of proofs Dana Moshkovitz, MIT

    Add to Reading List

    Source URL: people.csail.mit.edu

    Language: English - Date: 2012-04-12 18:03:28
    9Complexity classes / Computational complexity theory / Interactive proof system / Physical Unclonable Function / IP / Zero-knowledge proof / NP / NEXPTIME / Challenge-response authentication / Cryptography / Cryptographic protocols / Applied mathematics

    Virtual Proofs of Reality Ulrich R¨uhrmair [removed] Abstract—In this paper, we discuss the question how physical statements can be proven remotely over digital communication

    Add to Reading List

    Source URL: cryptome.org

    Language: English - Date: 2014-06-06 08:08:31
    10Complexity classes / Interactive proof system / IP / Arthur–Merlin protocol / NP / P/poly / NEXPTIME / True quantified Boolean formula / Zero-knowledge proof / Theoretical computer science / Computational complexity theory / Applied mathematics

    E-mail and the unexpected power of interaction L´ aszl´ o Babai ∗ E¨otv¨os University, Budapest and

    Add to Reading List

    Source URL: people.cs.uchicago.edu

    Language: English - Date: 2011-06-26 23:39:25
    UPDATE