𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Factoring Boolean functions using graph partitioning

✍ Scribed by Aviad Mintz; Martin Charles Golumbic


Book ID
108112506
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
290 KB
Volume
149
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Graph Functions of Boolean Functions
✍ Reischer, Corina; Simovici, Dan A. πŸ“‚ Article πŸ“… 1984 πŸ› IEEE 🌐 English βš– 511 KB
Improving graph partitions using submodu
✍ Sachin B. Patkar; H. Narayanan πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 203 KB

We investigate into the role of submodular functions in designing new heuristics and approximate algorithms to some NP-hard problems arising in the ΓΏeld of VLSI Design Automation. In particular, we design and implement e cient heuristic for improving a bipartition of a graph in the sense of ratioCut

Cryptographic Boolean Functions and Appl
✍ Cusick, Thomas W. πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier 🌐 English βš– 767 KB

Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce). Cryptographic Boolean Functions and Applications is a

Boolean function representation and spec
✍ A. Ε½uΕΎek; R. Drechsler; M.A. Thornton πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 301 KB

Methods based on AND/OR graph representations of Boolean relations provide a promising new way of approaching VLSI CAD design automation problems. AND/OR graphs can represent any Boolean network and they allow for systematic reasoning through the application of the technique of recursive learning. A