Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
141
Voted
FOCS
2010
IEEE
163
views
Theoretical Computer Science
»
more
FOCS 2010
»
The Complexity of Distributions
15 years 22 days 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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision