Open AccessAn enumerative problem in threshold logic
Author(s) -
Zana Kovijanic-Vukicevic
Publication year - 2007
Publication title -
publications de l institut mathematique
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 17
eISSN - 1820-7405
pISSN - 0350-1302
DOI - 10.2298/pim0796129k
Subject(s) - mathematics , computer science , arithmetic
The number of Boolean threshold functions is investigated. A new lower bound on the number of n-dimensional threshold functions on a set {0, 1,..., K − 1} is given.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom