RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive

Izv. Vyssh. Uchebn. Zaved. Mat., 2017 Number 7, Pages 41–49 (Mi ivm9257)

About complexity of implementing threshold functions

O. N. Muzychenko

Baltic State Technical University “Voenmekh” named after D.F. Ustinov, 1 Pervaya Krasnoarmeiskaya str., St.-Petersburg, 190005 Russia

Abstract: We study properties and ways of classification of threshold functions as well as known estimates of complexity of implementing in the functional elements type of circuits. We determine a dependence of the maximum values of variables weights on their number. Using the intermediate conversion method we obtain a precise upper bound of complexity of implementing arbitrary threshold functions in the functional elements type of circuits.

Keywords: threshold functions, functional elements, complexity.

UDC: 519.6

Received: 15.02.2016


 English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2017, 61:7, 35–42

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024