Approximate set union via approximate randomization

DOI10.1007/978-3-030-58150-3_48OpenAlexW3081934924MaRDI QIDQ5918258

Yuming Zhao, Bin Fu, Pengfei Gu

Publication date: 21 April 2021

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

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

zbMATH Keywords

lattice pointsroundsrandomized approximationsublinear time\#P-hard

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• The complexity of computing the permanent
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Probabilistic counting algorithms for data base applications
• PP is closed under truth-table reductions
• Optimal Streaming and Tracking Distinct Elements with High Probability
• Monte-Carlo approximation algorithms for enumeration problems
• Probability Inequalities for Sums of Bounded Random Variables
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate set union via approximate randomization