Finding the Best CAFE Is NP-Hard
From MaRDI portal
Publication:3557033
DOI10.1007/978-3-642-12200-2_32zbMath1283.68156MaRDI QIDQ3557033
Lucia Moura, Elizabeth Maltais
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_32
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, Covering arrays avoiding forbidden edges