Vector sets for exhaustive testing of logic circuits

DOI10.1109/18.6031zbMath0653.94025OpenAlexW2065341612MaRDI QIDQ3799961

Gadiel Seroussi, Nader H. Bshouty

Publication date: 1988

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.6031

zbMATH Keywords

NP-complete problemtesting logic circuits

Mathematics Subject Classification ID

Related Items (36)

The cell probe complexity of succinct data structures ⋮ On the extremal combinatorics of the Hamming space ⋮ Exact learning from an honest teacher that answers membership queries ⋮ The test suite generation problem: optimal instances and their implications ⋮ Constraint models for the covering test problem ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ Mixed covering arrays on graphs of small treewidth ⋮ Exact learning of juntas from membership queries ⋮ Covering arrays on product graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ A hyperedge coloring and application in combinatorial testing ⋮ A formal logic approach to constrained combinatorial testing ⋮ Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm ⋮ Finding a hidden code by asking questions ⋮ Locating and detecting arrays for interaction faults ⋮ Algebraic Modelling of Covering Arrays ⋮ Upper bounds for covering arrays by tabu search. ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays ⋮ An efficient design and implementation of the in-parameter-order algorithm ⋮ Underapproximation for model-checking based on universal circuits ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Vertex Turán problems in the hypercube ⋮ Mixed optimization combinatorial method for constructing covering arrays ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ The complexity of exact learning of acyclic conditional preference networks from swap examples ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ DNF are teachable in the average case ⋮ On the capacity of Boolean graph formulæ ⋮ Learning a circuit by injecting values ⋮ A survey of methods for constructing covering arrays ⋮ Covering arrays avoiding forbidden edges ⋮ Covering arrays on graphs ⋮ A survey on the problems and algorithms for covering arrays via set covers ⋮ Upper Bounds on the Size of Covering Arrays

This page was built for publication: Vector sets for exhaustive testing of logic circuits