Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic
From MaRDI portal
Publication:5932894
zbMath1027.06500MaRDI QIDQ5932894
V. N. Shevchenko, Nikolai Yu. Zolotykh
Publication date: 17 June 2001
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A characterization of 2-threshold functions via pairs of prime segments ⋮ On teaching sets of \(k\)-threshold functions ⋮ On the number of irreducible points in polyhedra ⋮ Linear read-once and related Boolean functions ⋮ On Boolean threshold functions with minimum specification number ⋮ On teaching sets for 2-threshold functions of two variables
This page was built for publication: Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic
