Avoiding simplicity is complex

DOI10.1007/978-3-642-13962-8_1MaRDI QIDQ3576185zbMATH OpenOpenAlexFDO

Authors Eric Allender

Publication date 29 July 2010

Published in Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13962-8_1

zbMATH Keywords

complexity theoryhitting setsKolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Avoiding simplicity is complex
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
• Power from Random Strings
• scientific article; zbMATH DE number 1335898
• Resource-bounded Kolmogorov complexity revisited

Cited in

(9)

• Avoiding simplicity is complex
• Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity
• Simplify or perish
• Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
• Resource-bounded Kolmogorov complexity revisited
• scientific article; zbMATH DE number 5360956 (Why is no real title available?)
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
• Simplicity Is the Point
• What Simplicity Is Not

This page was built for publication: Avoiding simplicity is complex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576185)