A Lower Bound of the Number of Threshold Functions
From MaRDI portal
Publication:5507975
DOI10.1109/PGEC.1965.264090zbMath0135.18205OpenAlexW2015190299MaRDI QIDQ5507975
Toshihide Ibaraki, Shuzo Yajima
Publication date: 1965
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/pgec.1965.264090
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Weights of exact threshold functions ⋮ Size of ordered binary decision diagrams representing threshold functions ⋮ Root cones and the resonance arrangement ⋮ A Better Upper Bound on Weights of Exact Threshold Functions ⋮ Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices ⋮ A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem ⋮ Algebraic aspects of threshold logic ⋮ A lower time bound for the knapsack problem on random access machines
This page was built for publication: A Lower Bound of the Number of Threshold Functions
