Sequential diagnosability is co-NP complete

DOI10.1109/12.88482MaRDI QIDQ5375397zbMATH OpenOpenAlexFDO

Authors Anand Tripathi, Vijay Raghavan

Publication date 14 September 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(3)

• On sequential diagnosis of multiprocessor systems
• On diagnosability of large multiprocessor networks
• On diagnosability of large multiprocessor networks

This page was built for publication: Sequential diagnosability is co-NP complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375397)