Need info on NP-complete problem

Article View: comp.theory

Article #1919

#1919

From: Keith Pierce
Date: Fri, 08 Jan 1993 19:58

18 lines
953 bytes

I would like to find out more information on the problems
   [MS17] Fault Detection in Logic Circuits
   [MS18] Fault Detection in Directed Graphs
  
The numbers are from the Garey-Johnson text. That text cites only one
old reference [Ibarra and Sahni 1975] and one unpublished manuscript
[Ibaraki, Kameda, Toida 1977].

Does anyone have any further information on this class of problems?


Keith Pierce, Professor
Department of Computer Science 
University of Minnesota, Duluth
Duluth, MN 55812-2496

internet: kpierce@d.umn.edu
bellnet:  218-726-7194

Technical Details

Message-ID: <1ikmdvINN7rp@andre.d.umn.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!gatech!concert!rutgers!news.cs.indiana.edu!umn.edu!news.d.umn.edu!not-for-mail

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!gatech!concert!rutgers!news.cs.indiana.edu!umn.edu!news.d.umn.edu!not-for-mail
From: kpierce@andre.d.umn.edu (Keith Pierce)
Newsgroups: comp.theory
Subject: Need info on NP-complete problem
Message-ID: <1ikmdvINN7rp@andre.d.umn.edu>
Date: 8 Jan 93 19:58:55 GMT
Organization: University of Minnesota, Duluth
Lines: 18
NNTP-Posting-Host: andre.d.umn.edu