Efficient testing of groups

DOI10.1145/1060590.1060614MaRDI QIDQ3581388zbMATH OpenOpenAlexFDO

Authors Katalin Friedl, Gábor Ivanyos, Miklos Santha

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060614

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Sets with a single binary operation (groupoids) (20N02)

Recommendations

• Optimal group testing
• Efficient two-stage group testing
• scientific article; zbMATH DE number 3980896
• An efficient algorithm for combinatorial group testing
• Efficient Algorithms for Noisy Group Testing
• Efficient group testing algorithms with a constrained number of positive responses
• An improved algorithm for quantitative group testing
• Bias of the lse estimator of the first order autoregressive model under tukey contamination
• The optimal procedures for quantitative group testing

Cited in

(13)

• Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions
• Testing commutativity of a group and the power of randomization.
• Derandomizing Homomorphism Testing in General Groups
• Born again group testing: Multiaccess communications
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Derandomizing homomorphism testing in general groups
• Derandomizing Graph Tests for Homomorphism
• On the derandomization of the graph test for homomorphism over groups
• Active Learning of Group-Structured Environments
• Group Testing With Nested Pools
• On testing group properties
• A characterization of testable hypergraph properties
• The optimal procedures for quantitative group testing

This page was built for publication: Efficient testing of groups

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