Vector analysis of threshold functions (Q1898474): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Vwani P. Roychowdhury / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Nicolae Tandareanu / rank | |||
| Property / author | |||
| Property / author: Vwani P. Roychowdhury / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Nicolae Tandareanu / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/inco.1995.1095 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061512596 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:18, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vector analysis of threshold functions |
scientific article |
Statements
Vector analysis of threshold functions (English)
0 references
17 September 1995
0 references
The authors study the realizability of Boolean functions using threshold gates. Using several tools from linear algebra they obtain various results concerning this subject (a lower bound for the number of input functions required by a threshold gate implementing a given function, the error incurred when a Boolean function is approximated, results on circuit complexity etc).
0 references
realizability of Boolean functions
0 references
threshold gates
0 references
