A simple analysis of the error probability of two-point based sampling

DOI10.1016/S0020-0190(96)00145-7MaRDI QIDQ1350935zbMATH OpenWikidataFDO

Authors K. S. Gopalakrishnan, D. R. Stinson

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Orthogonal arraysCombinatorial problemsDerandomizationTwo-point based sampling

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Recommendations

• A combinatorial error bound for \(t\)-point-based sampling
• On the power of two-point based sampling
• On using deterministic functions to reduce randomness in probabilistic algorithms
• Sampling algorithms: lower bounds and applications
• scientific article; zbMATH DE number 1419212

Cites work

• On a set of almost deterministic k-independent random variables
• On the power of two-point based sampling
• Provably good pattern generators for a random pattern test
• Some maximal arcs in finite projective planes

Cited in

(2)

• A combinatorial error bound for \(t\)-point-based sampling
• On the power of two-point based sampling

This page was built for publication: A simple analysis of the error probability of two-point based sampling

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