A Reduced Complexity Algorithm for Minimizing N-Detect Tests

? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exact but NP-hard integer linear programming (ILP) solution. In ILP, a test is represented by a [0, 1] integer variable and the sum of those variables is minimized. Constraints ensure that each fault has at least N tests with non-zero variables. Traditionally, the problem has been transformed to less complex LP by treating the variables as real numbers, regarded as probabilities with which they

• Type: Conference
• Year: 2007
• Where: VLSID
• Authors: Kalyana R. Kantipudi, Vishwani D. Agrawal
• Keywords: Computer Architecture, Non-zero Variables, NP-hard Integer Linear, Recursive Rounding Linear, VLSID 2007