A note on the \(k\)-restriction problem

DOI10.1016/J.IPL.2024.106515zbMATH Open1547.68842MaRDI QIDQ6602326

Jing-You Lin, Shi-Chun Tsai

Publication date: 11 September 2024

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

zbMATH Keywords

VC-dimensionrandomized algorithmsprobabilistic methods\(\varepsilon\)-netLovász local lemma

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\epsilon\)-nets and simplex range queries
• Almost tight bounds for \(\epsilon\)-nets
• Covering arrays of strength three
• Families of \(k\)-independent sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Algorithmic construction of sets for k -restrictions
• A constructive proof of the general lovász local lemma
• Upper Bounds on the Size of Covering Arrays
• New Constructive Aspects of the Lovász Local Lemma

This page was built for publication: A note on the \(k\)-restriction problem

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