Abstract
In the Introduction, problems related to combinatorial objects were divided into those of existence, counting, and classification, all of which can be attacked with computational methods. The existence problem – whenever answered in the positive by explicit construction – difiers from the others as the constructed object almost without exception can be presented in the published work and checked by hand calculation or by easy computations. Results related to the other types of problems, however, are of intrinsically different nature, and lead us to the somewhat controversial issue of validity of computational results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
Kaski, P., Östergård, P.R. (2006). Validity of Computational Results. In: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-28991-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-28991-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28990-6
Online ISBN: 978-3-540-28991-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)