Complexity of Complexity and Maximal Plain Versus Prefix-Free Kolmogorov Complexity

AuthID
 P-00P-786
1
Author(s)
4
Editor(s)
Czumaj, A; Mehlhorn, K; Pitts, A; Wattenhofer, R
Document Type
Proceedings Paper
Year published
2012
Published
in AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I in Lecture Notes in Computer Science, ISSN: 0302-9743
Volume: 7391, Pages: 100-108 (9)
Conference
39Th International Colloquium on Automata, Languages, and Programming (Icalp), Date: JUL 09-SEP 13, 2012, Location: Univ Warwick, Warwick, UNITED KINGDOM, Sponsors: Microsoft Res, Springer Verlag, European Assoc Theoret Comp Sci, Ctr Discrete Math Applicat, Host: Univ Warwick
Indexing
Wos®
Publication Identifiers
Wos: WOS:000342761000009
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service