On Resource-Bounded Versions of the van Lambalgen Theorem

DOI10.1007/978-3-319-55911-7_10zbMath1436.68150arXiv1704.01101OpenAlexW2603881675MaRDI QIDQ2988817

Himanshu Shukla, Diptarka Chakraborty, Satyadev Nandakumar

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.01101

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (2)

Finite-state relative dimension, dimensions of AP subsequences and a finite-state van Lambalgen's theorem ⋮ Uniform van Lambalgen's theorem fails for computable randomness

Cites Work

• Unnamed Item
• On symmetry of information and polynomial time invertibility
• Resource bounded symmetry of information revisited
• Algorithmic Randomness and Complexity
• When van Lambalgen’s Theorem fails
• On initial segment complexity and degrees of randomness
• Foundations of Cryptography
• Computability and Randomness
• Power from Random Strings
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: On Resource-Bounded Versions of the van Lambalgen Theorem