Compressibility and resource bounded measure

DOI10.1007/3-540-60922-9_2zbMath1379.68137OpenAlexW2145958468MaRDI QIDQ4593914

Luc Longpré, Harry Buhrman

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/1338

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

NP-hard sets are superterse unless NP is small ⋮ Dimension and the structure of complexity classes ⋮ Hard sets are hard to find

This page was built for publication: Compressibility and resource bounded measure