Resource-Bounded Complexity

  • Ming LiEmail author
  • Paul Vitányi
Part of the Texts in Computer Science book series (TCS)


Computability theory has a resource-bounded version in computational complexity theory. Similarly, Kolmogorov complexity boasts resourcebounded Kolmogorov complexity. Several authors suggested early on the possibility of restricting the power of the device used to (de)compress strings.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Ming Li and Paul Vitányi 2019

Authors and Affiliations

  1. 1.University of WaterlooWaterlooCanada
  2. 2.Centrum voor Wiskunde en Informatica (CWI)AmsterdamThe Netherlands

Personalised recommendations