Pages that link to "Item:Q1924226"
From MaRDI portal
The following pages link to Asymptotically optimal covering designs (Q1924226):
Displaying 14 items.
- General upper bounds on the minimum size of covering designs (Q1291117) (← links)
- Asymptotic optimality of regular sequence designs (Q1354523) (← links)
- Nearly perfect matchings in regular simple hypergraphs (Q1366948) (← links)
- Optimal covering designs: complexity results and new bounds (Q1765237) (← links)
- Random triangle removal (Q2346047) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Constructing designs straightforwardly: Worst arising cases (Q2713359) (← links)
- Variable neighborhood descent heuristic for covering design problem (Q2840773) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- Note on asymptotically good packings (Q3578141) (← links)
- New upper bounds on the minimum size of covering designs (Q4222173) (← links)
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484) (← links)
- Towards a Theory of Intrusion Detection (Q5862669) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
