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...

Full description

Bibliographic Details
Main Author: HromkoviČ, Juraj (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Series:Texts in Theoretical Computer Science An EATCS Series,
Subjects:
Online Access:Full Text via HEAL-Link

Internet

Full Text via HEAL-Link

ΒΚΠ - Πατρα: ALFd

Holdings details from ΒΚΠ - Πατρα: ALFd
Call Number: 330.01 BAU
Copy 1 Available

ΒΚΠ - Πατρα: BSC

Holdings details from ΒΚΠ - Πατρα: BSC
Call Number: 330.01 BAU
Copy 2 Available
Copy 3 Available