The following pages link to (Q3268318):
Displaying 24 items.
- Diagnosis of three types of constant faults in read-once contact networks over finite bases (Q278720) (← links)
- Tests of contact closure for contact circuits (Q341824) (← links)
- On the relation between rough set reducts and typical testors (Q526674) (← links)
- On diagnostic tests of contact break for contact circuits (Q783101) (← links)
- The length of a single fault detection test for constant-nonpreserving element insertions (Q830998) (← links)
- Single fault detection tests for generalized iterative switching circuits (Q887392) (← links)
- Fault detection tests for stuck-at faults on parity counter inputs (Q895069) (← links)
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- On fault detection tests of contact break for contact circuits (Q1741470) (← links)
- Lower bounds for the lengths of single tests for Boolean circuits (Q1741479) (← links)
- Complete diagnostic length 2 tests for logic networks under inverse faults of logic gates (Q1798079) (← links)
- Bounds on Shannon functions of lengths of contact closure tests for contact circuits (Q2050225) (← links)
- Lower bound of the length of a single fault diagnostic test with respect to insertions of a mod-2 adder (Q2096002) (← links)
- Short tests of closures for contact circuits (Q2192016) (← links)
- Short single tests for circuits with arbitrary stuck-at faults at outputs of gates (Q2332897) (← links)
- Diagnosis of constant faults in read-once contact networks over finite bases (Q2341754) (← links)
- Synthesis of circuits admitting complete checking tests of constant length under inverse faults at outputs of elements (Q2356509) (← links)
- On algorithms for construction of all irreducible partial covers (Q2379946) (← links)
- Unit checking output tests under constant faults for functional elements (Q2513254) (← links)
- Diagnosis of constant faults in iteration-free circuits over monotone basis (Q2636825) (← links)
- Minimizing depth of decision trees with hypotheses (Q2670891) (← links)
- Estimations of the lengths of tests for logic gates in presence of many permissible faults (Q3186843) (← links)
- Complete Fault Detection Tests of Length 2 for Logic Networks under Stuck-at Faults of Gates (Q4558289) (← links)
- Shannon function of the test length with respect to gate input identification (Q6195911) (← links)
