A new lower bound for the smallest complete (k, n)-arc in $$\mathrm {PG}(2, q)$$ PG ( 2 , q ).

S. Alabdullah J. W. P. Hirschfeld

Published in: Des. Codes Cryptogr. (2019)

Keyphrases

lower bound
upper bound
proximity graph
branch and bound algorithm
np hard
lower and upper bounds
worst case
branch and bound
neural network
optimal solution
linear programming relaxation
lower bounding
polynomial approximation