Bounds on data limits for all-to-all comparison from combinatorial designs

arXiv2309.00213MaRDI QIDQ6449447FDOQ6449447

Authors: Joanne L. Hall, Daniel Horsley, D. R. Stinson 

Publication date: 31 August 2023

Mathematics Subject Classification ID

Data structures (68P05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

This page was built for publication: Bounds on data limits for all-to-all comparison from combinatorial designs

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