An interactive proof system is called doubly-efficient if the
prescribed prover strategy can be implemented in polynomial-time
and the verifier's strategy can be implemented in almost-linear
time. Such proof systems make the benefits of interactive proof
system available to real-life agents who are restricted to
polynomial-time computation. This book surveys some of the known
results regarding doubly-efficient interactive proof systems. It
starts by presenting two simple constructions for t-no-CLIQUE,
where the first construction offers the benefit of being
generalized to any "locally characterizable" set, and the second
construction offers the benefit of preserving the combinatorial
flavor of the problem. It then turns to two more general
constructions of doubly-efficient interactive proof system: the
proof system for sets having (uniform) bounded-depth circuits and
the proof system for sets that are recognized in polynomial-time
and small space. The presentation of the GKR construction is
complete and is somewhat different from the original presentation.
A brief overview is provided for the RRR construction.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
