Computational complexity and property testing. On the interplay between randomness and computation

DOI10.1007/978-3-030-43662-9MaRDI QIDQ2152674zbMATH OpenOpenAlexFDO

Authors

Publication date 10 July 2022

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

Full work available at URL https://doi.org/10.1007/978-3-030-43662-9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(2)

• On certain computable tests and componentwise error bounds
• A measure of stochastic complexity and its power in testing for randomness.

This page was built for publication: Computational complexity and property testing. On the interplay between randomness and computation

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