Login / Signup
Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q).
Daniele Bartoli
Alexander A. Davydov
Alexey Kreshchuk
Stefano Marcugini
Fernanda Pambianco
Published in:
Electron. Notes Discret. Math. (2017)
Keyphrases
</>
upper bound
lower bound
upper and lower bounds
proximity graph
tight bounds
worst case
lower and upper bounds
data mining
small size
computational complexity
linear programming
theoretical analysis
branch and bound
sample complexity
data points
dynamic programming
constant factor
information retrieval
neural network