An upper bound on the size of diamond-free families of sets.
Dániel GrószAbhishek MethukuCasey TompkinsPublished in: J. Comb. Theory, Ser. A (2018)
Keyphrases
- upper bound
- lower bound
- worst case
- databases
- information retrieval
- constant factor
- lower and upper bounds
- machine learning
- branch and bound
- information systems
- computational complexity
- expert systems
- evolutionary algorithm
- image processing
- computer vision
- memory requirements
- maximum number
- search engine
- window size
- fixed size
- genetic algorithm