The threshold order of a Boolean function (Q805595): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Alton C. Williams / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Nicolae Tandareanu / rank | |||
Normal rank | |||
Revision as of 23:07, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The threshold order of a Boolean function |
scientific article |
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
