A nearly-optimal transfixing set

MaRDI QIDQ1363972zbMATHFDO

Authors Alexander E. Andreev

Publication date 11 March 1998

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

probabilistic algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 176875
• On the complexity of asymptotically optimal coverings and packings
• scientific article; zbMATH DE number 3286048
• Efficient constructions of hitting sets for systems of linear functions
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions

This page was built for publication: A nearly-optimal transfixing set

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