scientific article; zbMATH DE number 2196513

zbMATH Open1083.68052MaRDI QIDQ5465360FDOQ5465360

Authors: Lance Fortnow 

Publication date: 22 August 2005

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 107775
• scientific article; zbMATH DE number 107774
• Around Kolmogorov complexity: basic notions and results
• scientific article; zbMATH DE number 7701424
• Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets

zbMATH Keywords

complexity classesP/polyP-printable sets

Mathematics Subject Classification ID

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

Cited In (17)

• Randomness and intractability in Kolmogorov complexity
• Kolmogorov Complexity: Sources, Theory and Applications
• STACS 2005
• Title not available (Why is that?)
• Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity
• Kolmogorov complexity arguments in combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kolmogorov complexity conditional to large integers
• Logical operations and Kolmogorov complexity
• Weihrauch Complexity in Computable Analysis
• Kolmogorov complexity
• Kolmogorov Complexity Theory over the Reals
• Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
• NL-printable sets and nondeterministic Kolmogorov complexity
• Kolmogorov complexity and non-determinism
• Kolmogorov's contributions to information theory and algorithmic complexity

This page was built for publication:

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