Abstract
Judging by practical experience, solving classification problems for combinatorial objects such as codes and designs is a computationally demanding task. A question of a different nature is what can be said from the perspective of computational complexity theory, where it is common to regard a computational problem tractable only if it admits a polynomially resource-bounded algorithm, whereas problems for which no such algorithm exists are regarded as intractable.
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). Computational Complexity. 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_11
Download citation
DOI: https://doi.org/10.1007/3-540-28991-7_11
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)