An upper bound for the size of a k-uniform intersecting family with covering number k.
Andrii ArmanTroy RetterPublished in: J. Comb. Theory, Ser. A (2017)
Keyphrases
- upper bound
- maximum number
- small number
- constant factor
- computational complexity
- grow exponentially
- lower bound
- data sets
- linear functions
- running times
- memory requirements
- branch and bound algorithm
- worst case
- space requirements
- small size
- fixed number
- standard deviation
- image processing
- information systems
- search engine
- genetic algorithm
- information retrieval
- data mining