scientific article; zbMATH DE number 7602826

DOI10.4086/toc.2022.v018a021OpenAlexW4296754687MaRDI QIDQ5040833

William M. Hoza, Kuan Cheng

Publication date: 18 October 2022

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

Full work available at URL: https://doi.org/10.4086/toc.2022.v018a021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

derandomizationbranching programspseudorandomnessspace complexityhitting set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Paradigms for Unconditional Pseudorandom Generators

This page was built for publication: