Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3.
Daniele BartoliAlexander A. DavydovGiorgio FainaStefano MarcuginiFernanda PambiancoPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- upper bound
- lower bound
- lower and upper bounds
- upper and lower bounds
- worst case
- neural network
- small size
- database
- linear functions
- generalization error
- case study
- branch and bound
- tight bounds
- data mining
- machine learning
- maximum number
- branch and bound algorithm
- sufficient conditions
- genetic algorithm
- artificial intelligence
- association rules
- website
- computational complexity
- training data