Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 28 мая 2015 г.
Аннотация:We consider the synthesis problem for the storage access function, which often appears as a component of integrated circuits and is also used in theoretical investigations. The precise value of the depth of the storage access function depending on n address variables, where 1 ≤ n ≤ 5 or n ≥ 20, is established over the standard basis under the assumption that the conjunction and disjunction gates have the depth 1 and that the negation gates have the depth 0. For the rest of the values of n the upper and the lower bounds for the specified depth are proven.