2
TITLE: Sophistication vs Logical Depth  Full Text
AUTHORS: Luis Antunes ; Bruno Bauwens; Andre Souto ; Andreia Teixeira ;
PUBLISHED: 2017, SOURCE: THEORY OF COMPUTING SYSTEMS, VOLUME: 60, ISSUE: 2
INDEXED IN: Scopus WOS DBLP CrossRef: 4
3
TITLE: An Additivity Theorem for Plain Kolmogorov Complexity  Full Text
AUTHORS: Bruno Bauwens; Alexander Shen;
PUBLISHED: 2013, SOURCE: THEORY OF COMPUTING SYSTEMS, VOLUME: 52, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef
4
TITLE: Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
AUTHORS: Bruno Bauwens;
PUBLISHED: 2012, SOURCE: 39th International Colloquium on Automata, Languages, and Programming (ICALP) in AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012 PT I, VOLUME: 7391
INDEXED IN: WOS