• usp_easy_retunsFree & Easy Returns
  • usp_best_dealsBest Deals
placeholder
Advanced BDD Optimization
magnifyZoom

Advanced BDD Optimization

479.00
nudge icon
Free Delivery
nudge icon
Free Delivery
noon-marketplace
Get it by 31 July
Order in 8h42m

Payment discount

Product Overview

Specifications

PublisherSpringer; Softcover reprint of hardcover 1st ed. 2005 edition
ISBN 10144193796X
Book FormatPaperback
Book DescriptionPreface. 1. Introduction. 2. Preliminaries. 2.1. Notation. 2.2. Boolean Functions. 2.3. Decomposition of Boolean Functions. 2.4. Reduced Ordered Binary Decision Diagrams.- 3. Exact node Minimization. 3.1. Branch and Bound Algorithm. 3.2. A*-Based Optimization. 3.3. Summary.- 4. Heuristic node Minimization. 4.1. Efficient Dynamic Minimization. 4.2. Improved Lower Bounds for Dynamic Reordering. 4.3. Efficient Forms of Improved Lower Bounds. 4.4. Combination of Improved Lower Bounds with Classical Bounds. 4.5. Experimental Results. 4.6. Summary.- 5. Path Minimization. 5.1. Minimization of Number of Paths. 5.2. Minimization of Expected Path Length. 5.3. Minimization of Average Path Length. 5.4. Summary.- 6. Relation between SAT and BDDS. 6.1. Davis-Putnam Procedure. 6.2. On the Relation between DP Procedure and BDDs. 6.3. Dynamic Variable Ordering Strategy for DP Procedure. 6.4. Experimental Results. 6.5. Summary.- 7. Final Remarks. References. Index.
Number of Pages234 pages
ISBN 139781441937964
AuthorRudiger Ebendt
LanguageEnglish
Publication Date29 October 2010
Cart Total  479.00
placeholder
Advanced BDD Optimization
Advanced BDD Optimization
479.00
0

We're Always Here To Help

Reach out to us through any of these support channels

Shop On The Go

App StoreGoogle PlayHuawei App Gallery

Connect With Us

mastercardvisatabbytamaraamexcod