Symbolic boolean manipulation with ordered binary-decision diagrams
RE Bryant - ACM Computing Surveys (CSUR), 1992 - dl.acm.org
Ordered Binary-Decision Diagrams (OBDDs) represent Boolean functions as directed
acyclic graphs. They form a canonical representation, making testing of functional properties …
acyclic graphs. They form a canonical representation, making testing of functional properties …
Propositional reasoning by model.
This article describes a new theory of propositional reasoning, that is, deductions depending
on if, or, and, and not. The theory proposes that reasoning is a semantic process based on …
on if, or, and, and not. The theory proposes that reasoning is a semantic process based on …
NEQR: a novel enhanced quantum representation of digital images
Y Zhang, K Lu, Y Gao, M Wang - Quantum information processing, 2013 - Springer
Quantum computation is becoming an important and effective tool to overcome the high real-
time computational requirements of classical digital image processing. In this paper, based …
time computational requirements of classical digital image processing. In this paper, based …
Graph-based algorithms for boolean function manipulation
RE Bryant - Computers, IEEE Transactions on, 1986 - ieeexplore.ieee.org
In this paper we present a new data structure for representing Boolean functions and an
associated set of manipulation algorithms. Functions are represented by directed, acyclic …
associated set of manipulation algorithms. Functions are represented by directed, acyclic …
[图书][B] Digital integrated circuits
“La densità di componenti è raddoppiata ogni anno. Sicuramente, a breve termine ci si può
attendere che questo ritmo continui, o addirittura acceleri. Nel lungo periodo, la velocità è …
attendere che questo ritmo continui, o addirittura acceleri. Nel lungo periodo, la velocità è …
A flexible representation of quantum images for polynomial preparation, image compression, and processing operations
PQ Le, F Dong, K Hirota - Quantum Information Processing, 2011 - Springer
Abstract A Flexible Representation of Quantum Images (FRQI) is proposed to provide a
representation for images on quantum computers in the form of a normalized state which …
representation for images on quantum computers in the form of a normalized state which …
[图书][B] Cellular automata and complexity: collected papers
S Wolfram - 2018 - taylorfrancis.com
Are mathematical equations the best way to model nature? For many years it had been
assumed that they were. But in the early 1980s, Stephen Wolfram made the radical proposal …
assumed that they were. But in the early 1980s, Stephen Wolfram made the radical proposal …
[图书][B] Logic synthesis and optimization benchmarks user guide: version 3.0
S Yang - 1991 - Citeseer
Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 Page 1 Logic Synthesis
and Optimization Benchmarks User Guide Version 3.0 Saeyang Yang1 This report is issued to …
and Optimization Benchmarks User Guide Version 3.0 Saeyang Yang1 This report is issued to …
Efficient implementation of a BDD package
KS Brace, RL Rudell, RE Bryant - Proceedings of the 27th ACM/IEEE …, 1991 - dl.acm.org
Efficient manipulation of Boolean functions is an important component of many computer-
aided design tasks. This paper describes a package for manipulating Boolean functions …
aided design tasks. This paper describes a package for manipulating Boolean functions …
Tinygarble: Highly compressed and scalable sequential garbled circuits
We introduce Tiny Garble, a novel automated methodology based on powerful logic
synthesis techniques for generating and optimizing compressed Boolean circuits used in …
synthesis techniques for generating and optimizing compressed Boolean circuits used in …