Abstract

In this paper, a first systematic review and analysis of the current state of the art pertaining to complexity problems for a heavily researched class of designs, namely covering arrays, is presented. In addition to surveying all known complexity results for covering arrays, we formalize many informal notions and related concepts of the related literature. Last but not least, we also correct a number of misinterpretations and false statements which have appeared in the literature, regarding the NP-hardness of some problems related to covering arrays. Respectively, we update the current state of the art, enriching it also with our own results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.