P-functions and Boolean matrix factorization
a unified approach for wired, programmed, and microprogrammed implementations of discrete algorithms
Our rough guess is there are 62,000 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 8 minutes to read. With a half hour per day, this will take 8 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.
We earn a commission on purchases
Word Count
62,000 words, Guess
Page Count
248 pages
Identifiers
- Open LibraryOL2982441M
- ISBN-100387133585
- OCLC Control Number11178690
- OCLC Control Number499121864
- OCLC Control Numberpfunctionsboolea00thay
and 2 more
- Library of Congress Control Number84233327
- Goodreads3558927
Classifications
- DDC005
- LCCQA76.6 .T4452 1984
Subjects
Topics
Series Statement
- Lecture notes in computer science ;
Similar Books
Digital design
M. Morris Mano.
Introduction to Algorithms
Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, Charles E. Leiserson
The art of computer programming
Donald E. Knuth.
Mathematics for the analysis of algorithms
Daniel H. Greene, Donald E. Knuth.
Algorithms of Oppression: How Search Engines Reinforce Racism
Safiya Umoja Noble
Data Structures and Algorithms in Java
Roberto Tamassia, Michael T. Goodrich
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!