January 1, 1989· Lecture notes in computer science
conference-paper
Open access
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
Abstract
No abstract metadata is available for this record.
Community
0 commentsUse Connect Wallet in the navigation
No discussion yet
Be the first to share a question or observation.