<--- Back to Details
First PageDocument Content
Joseph Fourier / Representation theory / Applied mathematics / Sipser–Lautemann theorem / Structural complexity theory / Μ operator / Probabilistic complexity theory / Mathematics / Operator theory
Date: 2012-11-16 00:22:59
Joseph Fourier
Representation theory
Applied mathematics
Sipser–Lautemann theorem
Structural complexity theory
Μ operator
Probabilistic complexity theory
Mathematics
Operator theory

Communication Complexity 23 Sept, 2011 (@ TIFR)

Add to Reading List

Source URL: www.tcs.tifr.res.in

Download Document from Source Website

File Size: 251,38 KB

Share Document on Facebook

Similar Documents

Probability / Probabilistic complexity theory / Probability theory / PRISM model checker / Software / Sample space / Model checking / Stochastic process / Randomized algorithm

Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014

DocID: 1rrqu - View Document

Theoretical computer science / Lance Fortnow / Probabilistic complexity theory / Carsten Lund / Computer science / IP / BPP / Probabilistically checkable proof / Symposium on Foundations of Computer Science / Mathematics

Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

DocID: 1rgOi - View Document

Computational complexity theory / Complexity classes / IP / Proof of knowledge / NP / Soundness / Interactive proof system / PSPACE / Zero-knowledge proof / Probabilistic complexity theory / Mathematical proof / Quadratic residue

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rgbF - View Document

Markov models / Probability theory / Statistics / Probability / Probabilistic complexity theory / Markov processes / Statistical models / Graph theory / Markov chain / Randomized algorithm / Stochastic process / Algorithm

Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By

DocID: 1rdMz - View Document

Cryptography / Polynomials / Probabilistic complexity theory / IP / Commitment scheme / NP / Interactive proof system / Zero-knowledge proof / Polynomial interpolation / Polynomial / Random self-reducibility / Permutation polynomial

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

DocID: 1raDV - View Document