<--- Back to Details
First PageDocument Content
Probabilistic complexity theory / Pseudorandomness / Algorithmic information theory / Pseudorandom generator / Average-case complexity / Information-theoretic security / Randomized algorithm / Russell Impagliazzo / List decoding / Theoretical computer science / Applied mathematics / Computational complexity theory
Date: 2009-04-05 12:14:36
Probabilistic complexity theory
Pseudorandomness
Algorithmic information theory
Pseudorandom generator
Average-case complexity
Information-theoretic security
Randomized algorithm
Russell Impagliazzo
List decoding
Theoretical computer science
Applied mathematics
Computational complexity theory

Add to Reading List

Source URL: www1.cs.columbia.edu

Download Document from Source Website

File Size: 122,17 KB

Share Document on Facebook

Similar Documents

V. G. VOVK ON A CRITERION OF RANDOMNESS (Communicated by Academician A. N. Kolmogorov, This work belongs to algorithmic information theory (seeTheorem 1 shows that if some sequence is random with resp

DocID: 1uGQs - View Document

Causal Inference by Direction of Information Jilles Vreeken◦ Abstract We focus on data-driven causal inference. In particular, we propose a new principle for causal inference based on algorithmic information theory, i.

DocID: 1s7E7 - View Document

Foreign relations / Law / Government / Climate change policy / Carbon finance / Conferences / OECC / Optoelectronics / Environmental treaties / Emissions trading / Carbon offset / Algorithmic Number Theory Symposium

Microsoft Word - New Mechanisms Information Platform E-mail Newsletter Vol.55

DocID: 1rhiC - View Document

Theoretical computer science / Theory of computation / Algorithmic information theory / Computability theory / Academia / Randomness / Turing machine / Kolmogorov complexity / Algorithmically random sequence / Algorithmic probability / Minimum description length / Complexity

Powerpoint-presentation Information and Computing Sciences

DocID: 1rg8s - View Document

Information theory / Randomness / Metaphysics / Theoretical computer science / Theory of computation / Entropy / Kolmogorov complexity / Sophistication / Complexity / Random sequence / Algorithmic information theory / Mutual information

Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton Scott Aaronson∗ Sean M. Carroll†

DocID: 1raML - View Document