Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Robustness of average-case meta-complexity via pseudorandomness - MaRDI portal

Robustness of average-case meta-complexity via pseudorandomness

From MaRDI portal

Publication:6083613

Jump to:navigation, search

DOI10.1145/3519935.3520051WikidataQ130972785 ScholiaQ130972785MaRDI QIDQ6083613

Rahul Ilango, Rahul Santhanam, Hanlin Ren

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexity average-case complexity one-way functions minimum circuit size problem coding theorem meta-complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions

This page was built for publication: Robustness of average-case meta-complexity via pseudorandomness

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6083613&oldid=35519464"