Article
Licensed
Unlicensed
Requires Authentication
On complete tests for contact circuits without quasi-repetitions
-
KH. A. MADATYAN
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1996
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- 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
Articles in the same Issue
- 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
