First Page | Document Content | |
---|---|---|
![]() Date: 2007-01-18 15:34:42Cryptographic 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 | Source URL: crypto.cs.mcgill.caDownload Document from Source WebsiteFile Size: 6,55 MBShare Document on Facebook |
![]() | Under consideration for publication in J. Functional Programming 1 FUNCTIONAL PEARLS Probabilistic Functional Programming in HaskellDocID: 1oV9y - View Document |
![]() | Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139DocID: 190H8 - View Document |
![]() | Generating counterexamples for quantitative safety specifications in probabilistic B Ukachukwu Ndukwu1 Department of Computing, Macquarie University, NSW 2109 Sydney, Australia. AbstractDocID: 15Hau - View Document |
![]() | Modeling and Querying Probabilistic XML Data 1 Benny KimelfeldDocID: 14J1c - View Document |
![]() | LNCSComputational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic PerspectiveDocID: 120kj - View Document |