(Q59662701)

English

Thomas Vidick

computer scientist

  • T. Vidick

Statements

0 references
For his breakthroughs in quantum complexity and quantum cryptography that led to the proof that the class of languages in which membership may be established by quantum multi-prover interactive proof systems is equal to the class of recursively enumerable languages. (English)

Identifiers

 
edit
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit