There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 56

Record: found
Abstract: not found
Article: not found

The Knowledge Complexity of Interactive Proof Systems

Shafi Goldwasser, Silvio Micali, Charles Rackoff (1989)

0 comments Cited 320 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Proof verification and the hardness of approximation problems

Sanjeev Arora, Carsten Lund, Rajeev Motwani … (1998)

0 comments Cited 157 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Probabilistic checking of proofs: a new characterization of NP

Sanjeev Arora, Shmuel Safra (1998)

0 comments Cited 97 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2019

Publication date (Online): August 01 2019

Pages: 701-732

DOI: 10.1007/978-3-030-26954-8_23

SO-VID: 3b77c1aa-4ef5-446b-8ca6-5cf42946fa7a

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 5

See all cited by

Scalable Zero Knowledge with No Trusted Setup

Read this book at

Related collections

Indigenous Knowledge

Most cited references 56

The Knowledge Complexity of Interactive Proof Systems

Proof verification and the hardness of approximation problems

Probabilistic checking of proofs: a new characterization of NP

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,983

Cited by 5