Polynomially Complete Fault Detection Problems
From MaRDI portal
Publication:4057596
DOI10.1109/T-C.1975.224205zbMath0302.68063MaRDI QIDQ4057596
Oscar H. Ibarra, Sartaj K. Sahni
Publication date: 1975
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items
A series of impulse functions as a model for random detectability profiles, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Maxx: Test pattern optimisation with local search over an extended logic, DNA computing approach for automated test pattern generation for digital circuits, Confidence intervals for expected coverage from a beta testability model, Exhaustive testing of almost all devices with outputs depending on limited number of inputs, GENERATING TEST PATTERNS FOR FPGA CIRCUITS: A QUANTUM COMPUTING APPROACH, Development of tests for VLSI circuit testability at the upper design levels, Electronic circuit diagnostic expert systems - a survey, DNA and quantum based algorithms for VLSI circuits testing
