MODp-tests, almost independence and small probability spaces

DOI10.1007/BFB0023455zbMATH Open1498.60041OpenAlexW1518170105MaRDI QIDQ5047166FDOQ5047166

Claudia Bertram-Kretzberg, Hanno Lefmann

Publication date: 9 November 2022

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

Full work available at URL: https://doi.org/10.1007/bfb0023455

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial probability (60C05)

Cites Work

• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Title not available (Why is that?)
• Simple Constructions of Almost k-wise Independent Random Variables
• Title not available (Why is that?)
• Quasi-random graphs
• Ramanujan graphs
• A well-characterized approximation problem
• On the computational power of depth 2 circuits with threshold and modulo gates
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• The probabilistic method yields deterministic parallel algorithms
• Simulating (log ^c n )-wise independence in NC
• On construction of \(k\)-wise independent random variables

Cited In (1)

• Improved algorithms via approximations of probability distributions

This page was built for publication: MODp-tests, almost independence and small probability spaces

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