Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On complete tests for contact circuits without quasi-repetitions
-
KH. A. MADATYAN
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1996
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- On the class of weakly semiabelian polyadic groups
- Scheduling problem: complexity analysis and polynomially solvable subclasses
- On metric clustering
- Instantly solvable search problems
- On complete tests for contact circuits without quasi-repetitions
- On decidability of the completeness problem for special systems of automaton functions
- A new version of the proof of completeness criterion for k-valued logic functions
Artikel in diesem Heft
- On the class of weakly semiabelian polyadic groups
- Scheduling problem: complexity analysis and polynomially solvable subclasses
- On metric clustering
- Instantly solvable search problems
- On complete tests for contact circuits without quasi-repetitions
- On decidability of the completeness problem for special systems of automaton functions
- A new version of the proof of completeness criterion for k-valued logic functions
