i Computational Complexity: A Modern

First Page		Document Content
Date: 2007-01-08 22:01:30 Complexity classes Probabilistic complexity theory Analysis of algorithms Quantum complexity theory Bounded-error probabilistic polynomial PP Randomized algorithm Probabilistic Turing machine Time complexity Theoretical computer science Computational complexity theory Applied mathematics		i Computational Complexity: A Modern Add to Reading List Source URL: www.cs.princeton.edu Download Document from Source Website File Size: 482,41 KB Share Document on Facebook

	Under consideration for publication in J. Functional Programming 1 FUNCTIONAL PEARLS Probabilistic Functional Programming in Haskell DocID: 1oV9y - View Document
	Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139 DocID: 190H8 - View Document
	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
	Modeling and Querying Probabilistic XML Data 1 Benny Kimelfeld DocID: 14J1c - View Document
	LNCSComputational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective DocID: 120kj - View Document