Abstract
Computer Science Department
Keywords
Boolean functionComputer scienceAnd-inverter graphAlgorithmExponential functionGraphTheoretical computer scienceBoolean circuitMathematics
Affiliated Institutions
Related Publications
New spectral methods for ratio cut partitioning and clustering
Partitioning of circuit netlists in VLSI design is considered. It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approxi...
A soft-switching high-voltage active power filter with flying capacitors for urban Maglev system applications
This paper describes a newly developed soft-switching high-voltage active power filter for urban Maglev system applications. The active filter consists of a flying capacitor-bas...
Information transfer and area-time tradeoffs for VLSI multiplication
The need to transfer information between processing elements can be a major factor in determining the performance of a VLSI circuit. We show that communication considerations al...
Barren plateaus in quantum neural network training landscapes
Many experimental proposals for noisy intermediate scale quantum devices involve training a parameterized quantum circuit with a classical optimization loop. Such hybrid quantum...
Quantum circuit complexity
We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a qua...
Publication Info
- Year
- 1986
- Type
- article
- Volume
- C-35
- Issue
- 8
- Pages
- 677-691
- Citations
- 8815
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
8815
OpenAlex
Cite This
Bryant
(1986).
Graph-Based Algorithms for Boolean Function Manipulation.
IEEE Transactions on Computers
, C-35
(8)
, 677-691.
https://doi.org/10.1109/tc.1986.1676819
Identifiers
- DOI
- 10.1109/tc.1986.1676819