Propositional logic
deduction and algorithms
Our rough guess is there are 102,250 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 49 minutes to read. With a half hour per day, this will take 14 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
Contributions
- Lettman, Theodor. - Contributor
Publication
1999 - Cambridge University Press, Cambridge [England, England
Language
English
Word Count
102,250 words, Guess
Page Count
409 pages
Identifiers
- Open LibraryOL18820915M
- ISBN-100521630177
- OCLC Control Number39655053
- Library of Congress Control Number98038806
- LibraryThing2623401
and 1 more
- Goodreads6939672
Classifications
- DDC004/.01/5113
- LCCQA76.9.L63 P76 1999
Subjects
Topics
Series Statement
- Cambridge tracts in theoretical computer science -- 48.
Other Editions
- Propositional logic: deduction and algorithms
Similar Books
Algorithm design
Jon Kleinberg, Éva Tardos
Concrete mathematics: a foundation for computer science
Ronald L. Graham, Donald E. Knuth, Oren Patashnik.
Data Structures and Algorithms in Java
Roberto Tamassia, Michael T. Goodrich
Introduction to Algorithms
Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, Charles E. Leiserson
Data structures and network algorithms
Robert Endre Tarjan.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!