The Complexity of Distributions

14 years 9 months ago

Download www.ccs.neu.edu

Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of generating

Emanuele Viola

Real-time Traffic

Complexity Theory | FOCS 2010 | Lower Bounds | Random Bits | Theoretical Computer Science |

claim paper

Related Content

» Indexing Distributed Complex Data for Complex Queries

» Effective Complexity Reduction for Optimal Scheduling of Distributed RealTime Applications

» Complex Adaptive KnowledgeFlows and Workflows

» On the Complexity of Loop Fusion

» A Reliable Software Architecture for Complex Embedded Systems

» Contentionfree Complexity of Shared Memory Algorithms

» Mythbusters event stream processing versus complex event processing

» Language as a Complex Adaptive System

» On the Computational Complexity of Optimal Sorting Network Verification

» Message Complexity of Simple Ringbased Election Algorithms An Empirical Analysis

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FOCS
Authors	Emanuele Viola

Comments (0)

Sciweavers

The Complexity of Distributions

Complexity Theory | FOCS 2010 | Lower Bounds | Random Bits | Theoretical Computer Science |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers