Design and Analysis of Randomized Algorithms : Introduction to Design Paradigms /
Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of ye...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2005.
|
| Series: | Texts in Theoretical Computer Science An EATCS Series.
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |