
Gifting Made Simple
Give the Gift of ChoiceClick below to purchase a Bramalea City Centre eGift Card that can be used at participating retailers at Bramalea City Centre.Purchase HereHome
Logic Synthesis and Verification Algorithms
Coles
Loading Inventory...
Logic Synthesis and Verification Algorithms in Brampton, ON
Current price: $145.95

Coles
Logic Synthesis and Verification Algorithms in Brampton, ON
Current price: $145.95
Loading Inventory...
Size: Paperback
*Product information and pricing may vary - to confirm current pricing, availability, shipping, and return information please contact Coles. In the event of a pricing discrepancy, the retailer's price will apply.
Logic Synthesis and Verification Algorithms is a textbook designed for courses on VLSI Logic Synthesis and Verification, Design Automation, CAD and advanced level discrete mathematics. It also serves as a basic reference work in design automation for both professionals and students.
Logic Synthesis and Verification Algorithms is about the theoretical underpinnings of VLSI (Very Large Scale Integrated Circuits). It combines and integrates modern developments in logic synthesis and formal verification with the more traditional matter of Switching and Finite Automata Theory. The book also provides background material on Boolean algebra and discrete mathematics.
A unique feature of this text is the large collection of solved problems.
Throughout the text the algorithms covered are the subject of one or more problems based on the use of available synthesis programs.
Logic Synthesis and Verification Algorithms is a textbook designed for courses on VLSI Logic Synthesis and Verification, Design Automation, CAD and advanced level discrete mathematics. It also serves as a basic reference work in design automation for both professionals and students.
Logic Synthesis and Verification Algorithms is about the theoretical underpinnings of VLSI (Very Large Scale Integrated Circuits). It combines and integrates modern developments in logic synthesis and formal verification with the more traditional matter of Switching and Finite Automata Theory. The book also provides background material on Boolean algebra and discrete mathematics.
A unique feature of this text is the large collection of solved problems.
Throughout the text the algorithms covered are the subject of one or more problems based on the use of available synthesis programs.





















