On the complexity of deciphering the threshold functions of \(k\)-valued logic
From MaRDI portal
Publication:1594168
zbMath0959.68524MaRDI QIDQ1594168
V. N. Shevchenko, Nikolai Yu. Zolotykh
Publication date: 28 January 2001
Published in: Doklady Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
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 ⋮ Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids ⋮ On teaching sets for 2-threshold functions of two variables
This page was built for publication: On the complexity of deciphering the threshold functions of \(k\)-valued logic
