<--- Back to Details
First PageDocument Content
Cryptographic protocols / Complexity classes / Probabilistic complexity theory / Zero-knowledge proof / Interactive proof system / IP / Quantum complexity theory / NP / Probabilistic Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2007-01-18 15:34:42
Cryptographic protocols
Complexity classes
Probabilistic complexity theory
Zero-knowledge proof
Interactive proof system
IP
Quantum complexity theory
NP
Probabilistic Turing machine
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: crypto.cs.mcgill.ca

Download Document from Source Website

File Size: 6,55 MB

Share Document on Facebook

Similar Documents

Probability distributions / Probability theory / Probabilistic complexity theory / Monty Hall problem / Normalizing constant / Expected value / Normal distribution / Uniform distribution / Distribution / Probabilistic Turing machine

Under consideration for publication in J. Functional Programming 1 FUNCTIONAL PEARLS Probabilistic Functional Programming in Haskell

DocID: 1oV9y - View Document

Structural complexity theory / Complexity classes / Models of computation / Lance Fortnow / Probabilistic complexity theory / Interactive proof system / IP / Bounded-error probabilistic polynomial / Probabilistic Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics

Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139

DocID: 190H8 - View Document

Probabilistic complexity theory / Complexity classes / Probabilistic Turing machine / Turing machine / PP / NL / Predicate transformer semantics / IP / Model checking / Theoretical computer science / Computational complexity theory / Applied mathematics

Generating counterexamples for quantitative safety specifications in probabilistic B Ukachukwu Ndukwu1 Department of Computing, Macquarie University, NSW 2109 Sydney, Australia. Abstract

DocID: 15Hau - View Document

Applied mathematics / Statistics / Bayesian network / Randomized algorithm / Probabilistic Turing machine / Probabilistic complexity theory / Theoretical computer science / Networks

Modeling and Querying Probabilistic XML Data 1 Benny Kimelfeld

DocID: 14J1c - View Document

Models of computation / Computability theory / Turing machine / Probabilistic complexity theory / Probabilistic Turing machine / Computational complexity theory / Randomized algorithm / Algorithm / NP / Theoretical computer science / Applied mathematics / Computer science

LNCSComputational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective

DocID: 120kj - View Document