Complexity classifications of Boolean constraint satisfaction problems
Our rough guess is there are 26,500 words in this book.
At a pace averaging 250 words per minute, this book will take 1 hours and 46 minutes to read. With a half hour per day, this will take 4 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
- Khanna, Sanjeev. - Contributor
- Sudan, Madhu. - Contributor
Publication
2001 - Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania
Language
English
Word Count
26,500 words, Guess
Page Count
106 pages
Identifiers
- Internet Archivecomplexityclassi00crei
- Internet Archivecomplexityclassi00crei_435
- ISBN-100898714796
- ISBN-139780898714791
- Goodreads1484795
and 3 more
- Library of Congress Control Number00050988
- Better World Books9780898714791
- Open LibraryOL17151359M
Classifications
- DDC511.3
- LCCQA267.7 .C74 2001
Subjects
Series Statement
- SIAM monographs on discrete mathematics and applications
Other Editions
- Complexity classifications of Boolean constraint satisfaction problems
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!