Upper bounds on the smallest size of a complete cap in $\mathrm{PG}(N, q)$, $N\ge3$, under a certain probabilistic conjecture.
Alexander A. DavydovGiorgio FainaStefano MarcuginiFernanda PambiancoPublished in: CoRR (2017)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- bayesian networks
- branch and bound algorithm
- tight bounds
- special case
- worst case
- data driven
- data sets
- sample size
- theoretical analysis
- probabilistic reasoning
- posterior probability
- branch and bound
- information theoretic
- semi supervised
- genetic algorithm