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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
7
click to vote
TCS
2002
favorite
Email
discuss
report
73
views
Theoretical Computer Science
»
more
TCS 2002
»
Logical operations and Kolmogorov complexity
13 years 3 months ago
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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision