𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unbounded fan-in circuits and associative functions

✍ Scribed by Ashok K. Chandra; Steven Fortune; Richard Lipton

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
869 KB
Volume
30
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Computation of Boolean Functions
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
✍ GyΓΆrgy TurΓ‘n; Farrokh Vatan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 741 KB

We consider the complexity of computing Boolean functions by analog circuits of bounded fan-in, i.e., by circuits of gates computing real-valued functions, either exactly or as sign-representation. Sharp upper bounds are obtained for the complexity of the most difficult n-variable function over cert

Functional relaxations and spectral tech
Functional relaxations and spectral techniques in Computer-Aided circuit analysis
✍ Marcello W. Guarini; Olgierd A. Palusinski πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 717 KB

## Abstract Analysis of transients in integrated circuits is performed with the use of highly specialized computer programs. The transient responses are computed using time‐marching integration methods and require a substantial amount of computer time. A new method based on spectral analysis and wa