Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Computational Complexity and Knowledge Complexity

From MaRDI portal
Publication:4210087
Jump to:navigation, search

DOI10.1137/S0097539795280524zbMATH Open0907.68082MaRDI QIDQ4210087FDOQ4210087


Authors: Oded Goldreich, Rafail Ostrovsky, Erez Petrank Edit this on Wikidata


Publication date: 20 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)





Recommendations

  • Computational complexity and knowledge complexity (extended abstract)
  • On the knowledge complexity of \(\mathcal N\mathcal P\)
  • The knowledge complexity of interactive proof-systems
  • Statistical zero-knowledge languages can be recognized in two rounds


zbMATH Keywords

complexity classescryptographyzero knowledgerandomnessinteractive proofsknowledge complexity


Mathematics Subject Classification ID

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



Cited In (4)

  • Perfect Non-interactive Zero Knowledge for NP
  • Computational complexity and knowledge complexity (extended abstract)
  • Title not available (Why is that?)
  • On the knowledge complexity of \(\mathcal N\mathcal P\)





This page was built for publication: Computational Complexity and Knowledge Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210087)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4210087&oldid=18065576"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 13:56. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki