scientific article; zbMATH DE number 7789150

DOI10.4086/TOC.2023.V019A010OpenAlexW4390471865MaRDI QIDQ6138070FDOQ6138070

Michael Mitzenmacher, David P. Woodruff, Author name not available (Why is that?), 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 of this publication is not available (Why is that?)

zbMATH Keywords

approximationspace complexitydirect sumstreamingHamming normalgorithms with predictions

Mathematics Subject Classification ID

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

Cites Work

• Lower bounds for one-way probabilistic communication complexity and their application to space complexity
• Title not available (Why is that?)
• Authors' Response

This page was built for publication:

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