Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

102

STACS
2007
Springer

92views Theoretical Computer Science» more STACS 2007»

Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity

15 years 9 months ago

Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity

Download www.liafa.jussieu.fr

Abstract. Merkle et al. [13] showed that all Kolmogorov-Loveland stochas

Laurent Bienvenu

Real-time Traffic

Merkle Et | STACS 2007 | Theoretical Computer Science |

claim paper

Related Content

» KolmogorovLoveland Randomness and Stochasticity

» Relative to a Random Oracle NP is Not Small

» The complexity of stochastic sequences

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	STACS
Authors	Laurent Bienvenu

Comments (0)