scientific article; zbMATH DE number 7563812

DOI10.4086/TOC.2022.V018A010OpenAlexW4285124435MaRDI QIDQ5093396

Emanuele Viola

Publication date: 26 July 2022

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

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

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

zbMATH Keywords

lower boundTuring machinepseudorandom generatortape

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of computing (68Qxx)

Cites Work

• On approximate majority and probabilistic time
• Inductive time-space lower bounds for SAT and related problems

This page was built for publication: