scientific article; zbMATH DE number 7789150

DOI10.4086/toc.2023.v019a010OpenAlexW4390471865MaRDI QIDQ6138070

Michael Mitzenmacher, David P. Woodruff, Unnamed Author, Guang Yang

Publication date: 16 January 2024

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

Full work available at URL: https://doi.org/10.4086/toc.2023.v019a010

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

zbMATH Keywords

approximationspace complexitydirect sumstreamingHamming normalgorithms with predictions

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Theory of computing (68Qxx)

Cites Work

• Lower bounds for one-way probabilistic communication complexity and their application to space complexity
• Authors' Response
• Unnamed Item

This page was built for publication: