The threshold order of a Boolean function (Q805595)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The threshold order of a Boolean function |
scientific article; zbMATH DE number 4204286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The threshold order of a Boolean function |
scientific article; zbMATH DE number 4204286 |
Statements
The threshold order of a Boolean function (English)
0 references
1991
0 references
This paper contains the following results: characterization of threshold functions of order n; the problem of recognizing whether a Boolean function is a threshold function of order m is an NP-complete problem; a characterization of threshold functions in terms of summability; the number of threshold functions for dimension \(n\leq 7\).
0 references
threshold functions
0 references
Boolean function
0 references
NP-complete problem
0 references
0.8688131
0 references
0.8665793
0 references
0.8639697
0 references
0.8482672
0 references
0.84706336
0 references
