You are here: Home :: Area NEM :: Mathematics

A. A. Voronenko

On the length of checking test for repetition-free functions in the basis {0, 1, &, ∨, ¬}

In this paper, we present upper and lower linear bounds for the Shannon function for length of checking tests for repetition-free functions in the basis {0, 1, &, ∨, ¬}.

Discrete Mathematics and Applications, Walter de Gruyter

Print ISSN: 0924-9266
Volume: 15, 05/2005
Pages: 313 - 318

Show full article (external site)

Show all available items of this journal

 

Area NEM