Computational Complexity and Local Algorithms: On the Interplay Between Randomness and Computation

Author:   Oded Goldreich
Publisher:   Springer International Publishing AG
Volume:   15700
ISBN:  

9783031889455


Pages:   451
Publication Date:   10 June 2025
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $168.16 Quantity:  
Add to Cart

Share |

Computational Complexity and Local Algorithms: On the Interplay Between Randomness and Computation


Add your own review!

Overview

Full Product Details

Author:   Oded Goldreich
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Volume:   15700
ISBN:  

9783031889455


ISBN 10:   3031889452
Pages:   451
Publication Date:   10 June 2025
Audience:   Professional and scholarly ,  College/higher education ,  Professional & Vocational ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Reviews

Author Information

Oded Goldreich is a Meyer W. Weisgal Professor at the Weizmann Institute of Science, Israel. Oded completed his graduate studies in 1983 under the supervision of Shimon Even, he was a postdoctoral fellow at MIT (1983–1986), a faculty member at the Technion (1986–1994), a visiting scientist at MIT (1995–1998), and a Radcliffe fellow at Harvard (2003–2004). Since 1995 he has been a member of the Computer Science and Applied Mathematics department at the Weizmann Institute. He is the author of “Modern Cryptography, Probabilistic Proofs and Pseudorandomness” (Springer, 1998), the two-volume work “Foundations of Cryptography” (Cambridge University Press, 2001, 2004), “Computational Complexity: A Conceptual Perspective” (Cambridge University Press, 2008), and “Introduction to Property Testing” (Cambridge University Press, 2017). Nader H. Bshouty is a Professor of Computer Science at the Technion – Israel Institute of Technology, Israel. He completed his doctoral studies in Computer Science in 1989 at the Technion under the supervision of Michael Kaminski, from 1989 to 1998, he held academic positions at the University of Calgary, Canada. Since 1999, he has been a professor at the Technion. His research focuses on Computational Learning Theory, Property Testing, Models of Computation, and the Complexity of Algebraic Computations. Dana Ron is the Lazarus Brothers Chair of Computer Engineering in the School of Electrical Engineering at Tel Aviv University, Israel. Dana completed her graduate studies in 1995 under the supervision of Naftali Tishby, she was an NSF postdoctoral fellow at MIT (1995–1997), a science scholar at the Bunting Institute, Radcliffe (1997–1998), and a Radcliffe fellow at Harvard (2003–2004). Since 1998 she has been a faculty member at Tel Aviv University. She is a fellow of the EATCS and ACM. Laliv Tauber completed her master’s thesis at the Weizmann Institute of Science in 2024.  

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

RGJUNE2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List