Quantifying knowledge complexity

DOI10.1007/S000370050019zbMath0942.68057OpenAlexW2055409626MaRDI QIDQ1300608

Erez Petrank, Oded Goldreich

Publication date: 1 September 1999

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370050019

zbMATH Keywords

knowledge complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

The graph clustering problem has a perfect zero-knowledge interactive proof ⋮ Zero-Knowledge Proofs of Proximity ⋮ On relationships between statistical zero-knowledge proofs ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries

This page was built for publication: Quantifying knowledge complexity