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
Publication Identifiers
Wos: WOS:000342761000009
Source Identifiers
ISSN: 0302-9743
Export Publication Metadata
Marked List
Citations
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.



CORE Conference
No information about CORE Rank

During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.

TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.

Journal Factors
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

Info
At this moment we don't have any links to full text documens.