|
|
The problem of selection of a set of partially distinguishable guardsKeywords: partially distinguishable guards , satisfiability , NP-complete Abstract: In this paper we consider the problem of selection of a set of partiallydistinguishable guards. We describe an approach to solve the problem.This approach is based on an explicit reduction from the problem to thesatisfiability problem.
|