On algorithmic statistics for space-bounded algorithms

DOI10.1007/S00224-018-9845-6MaRDI QIDQ6830312zbMATH OpenFDO

Authors Alexey Milovanov

Publication date 4 July 2019

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-018-9845-6

zbMATH Keywords

algorithmic statisticscomputational complexity theoryderandomizationKolmogorov complexityNisan-Wigderson generator

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Randomized algorithms (68W20)

This page was built for publication: On algorithmic statistics for space-bounded algorithms

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