Computer search for small complete caps |
| |
| Authors: | Patric R. J. Österg»rd |
| |
| Affiliation: | (1) Dept. of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, 02015 HUT, Finland |
| |
| Abstract: | A computer search method for finding small complete caps inPG(d,q) is considered. The problem is formulated as a combinatorial optimization problem to which record-to-record travel, a stochastic local search method, is applied. Several new complete caps are found and upper bounds on the number of points in the smallest complete caps inPG(d,q) are tabulated for small parameters.This research was supported by the Academy of Finland. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
