Representations of Discrete Functions
Our rough guess is there are 84,000 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 36 minutes to read. With a half hour per day, this will take 11 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Fujita, Masahiro - Contributor
Publication
1996 - Springer US, Boston, MA, United States
Language
English
Word Count
84,000 words, Guess
Page Count
336 pages
Physical Format
Electronic resource
Identifiers
- Internet Archiverepresentationsd00mina
- ISBN-101461285992
- ISBN-101461313856
- ISBN-139781461285991
- ISBN-139781461313854
and 4 more
- OCLC Control Number852788055
- Better World Books9781461285991
- Better World Books9781461313854
- Open LibraryOL27085337M
Classifications
- DDC621.3815
- LCCTK7888.4
- LCCTK7888.4TK1-9971TA34
and 1 more
- LCCTK7867-7867.5
Description
Representations of Discrete Functions is an edited volume containing 13 chapter contributions from leading researchers with a focus on the latest research results. The first three chapters are introductions and contain many illustrations to clarify concepts presented in the text. It is recommended that these chapters are read first. The book then deals with the following topics: binary decision diagrams (BDDs), multi-terminal binary decision diagrams (MTBDDs), edge-valued binary decision diagrams (EVBDDs), functional decision diagrams (FDDs), Kronecker decision diagrams (KDDs), binary moment diagrams (BMDs), spectral transform decision diagrams (STDDs), ternary decision diagrams (TDDs), spectral transformation of logic functions, other transformations oflogic functions, EXOR-based two-level expressions, FPRM minimization with TDDs and MTBDDs, complexity theories on FDDs, multi-level logic synthesis, and complexity of three-level logic networks. Representations of Discrete Functions is designed for CAD researchers and engineers and will also be of interest to computer scientists who are interested in combinatorial problems. Exercises prepared by the editors help make this book useful as a graduate level textbook.
Subjects
Other Editions
- Representations of Discrete Functions
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!