A new theorem in threshold logic and its application to multioperand binary adders (Q4467334): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5655273 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of computing symmetric functions using threshold circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating threshold circuits by rational functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simulating Threshold Circuits by Majority Circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Optimal Depth Threshold Circuits for Multiplication and Related Problems / rank | |||
Normal rank | |||
Latest revision as of 17:42, 6 June 2024
scientific article; zbMATH DE number 2071067
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new theorem in threshold logic and its application to multioperand binary adders |
scientific article; zbMATH DE number 2071067 |
Statements
A new theorem in threshold logic and its application to multioperand binary adders (English)
0 references
9 June 2004
0 references
switching theory
0 references
threshold logic
0 references
circuit complexity
0 references
computer arithmetic
0 references
binary adder
0 references
