Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic (Q5932894)
From MaRDI portal
scientific article; zbMATH DE number 1601057
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic |
scientific article; zbMATH DE number 1601057 |
Statements
Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic (English)
0 references
17 June 2001
0 references
complexity
0 references
linear inequality
0 references
Boolean threshold function
0 references
\(k\)-valued logic
0 references
