Описание
Oded Goldreich explores the intricate relationship between randomness and computation, delving into complex topics that challenge the boundaries of traditional cryptography. His research contributions shed light on significant problems, such as determining the shortest move sequence in the Graph-Generalized 15-Puzzle, revealing its classification within NP-complete problems.
Through this work, Goldreich invites readers to navigate the multifaceted landscape of complexity theory, offering keen insights into how randomness can influence computational processes and cryptographic methods. This blend of theory and practical application creates a rich tapestry for scholars and enthusiasts alike, eager to deepen their understanding of these essential concepts.
Through this work, Goldreich invites readers to navigate the multifaceted landscape of complexity theory, offering keen insights into how randomness can influence computational processes and cryptographic methods. This blend of theory and practical application creates a rich tapestry for scholars and enthusiasts alike, eager to deepen their understanding of these essential concepts.
Детали книги
Формат
Мягкая обложка
Страницы
576 страниц
Язык
Английский
Опубликовано
авг 27, 2011
Издатель
SPRINGER
ISBN-10
364222671X
ISBN-13
9783642226717