scientific article; zbMATH DE number 6783372
From MaRDI portal
Publication:5365016
zbMath1373.68238MaRDI QIDQ5365016
David P. Woodruff, T. S. Jayram
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133037
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Taylor Polynomial Estimator for Estimating Frequency Moments ⋮ Amplification of One-Way Information Complexity via Codes and Noise Sensitivity ⋮ Almost Optimal Explicit Johnson-Lindenstrauss Families ⋮ Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem ⋮ Unnamed Item
This page was built for publication:
