Sciweavers

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

90

TCS
2002

73views Theoretical Computer Science» more TCS 2002»

Logical operations and Kolmogorov complexity

15 years 2 months ago

Logical operations and Kolmogorov complexity

Download www.lif.univ-mrs.fr

Alexander Shen, Nikolai K. Vereshchagin

Real-time Traffic

TCS 2002 | Theoretical Computer Science |

claim paper

Related Content

» Kolmogorov complexity in perspective

» High Complexity Tilings with Sparse Errors

» Effective Complexity and its Relation to Logical Depth

» Depth as Randomness Deficiency

» Computing Entropy for Ortholog Detection

» Transfer Results for Hybrid Logic Part I The Case Without Satisfaction Operators

» Difficult Configurations On the Complexity of LTrL

» Logical Omniscience Via Proof Complexity

» Linear Time Logics Around PSL Complexity Expressiveness and a Little Bit of Succinctness

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TCS
Authors	Alexander Shen, Nikolai K. Vereshchagin

Comments (0)