Sublinear Time Approximate Sum via Uniform Random Sampling

DOI10.1007/978-3-642-38768-5_64zbMath1382.68326arXiv1202.6598OpenAlexW2116898946MaRDI QIDQ4925287

Wenfeng Li, Bin Fu, Zhiyong Peng

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.6598

zbMATH Keywords

randomizationapproximate sumsublinear time

Mathematics Subject Classification ID

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

This page was built for publication: Sublinear Time Approximate Sum via Uniform Random Sampling