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
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
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
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