Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial Time Testability of Circuits Generated by Input Decomposition
IEEE Transactions on Computers
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On Synthesis of Easily Testable (k, K) Circuits
IEEE Transactions on Computers
Fault detection in multi-core processors using chaotic maps
Proceedings of the 3rd Workshop on Fault-tolerance for HPC at extreme scale
| Hi-index | 14.98 |
The problems of identifying several nontrivial classes of Polynomial-Time Testable (PTT) circuits are shown to be NP-complete or harder. First, PTT classes obtained by using circuit decompositions proposed by Fujiwara (1988) and Chakradhar et al. (1990) are considered. Another type of decompositions, based on fanout-reconvergent (f-r) pairs, which also lead to PTT classes are proposed. The problems of obtaining these decompositions, and also some structurally similar general graph decompositions, are shown to be NP-complete or harder. Then, the problems of recognizing PTT classes formed by the Boolean formulae belonging to the weakly positive, weakly negative, bijunctive and affine classes are shown to be NP-complete.