Fault-tolerant search algorithms : reliable computation with unreliable information /
Why a book on fault-tolerant search algorithms? Searching is one of the fundamental problems in computer science. Time and again algorithmic and combinatorial issues originally studied in the context of search find application in the most diverse areas of computer science and discrete mathematics. O...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin Heidelberg
Springer Berlin Heidelberg Imprint Springer
2013.
|
| Series: | Monographs in Theoretical Computer Science. An EATCS Series,
|
| Subjects: | |
| Online Access: | Click here to view the full text content |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!