Pages that link to "Item:Q2817645"
From MaRDI portal
The following pages link to Computational complexity and knowledge complexity (extended abstract) (Q2817645):
Displaying 7 items.
- A language-dependent cryptographic primitive (Q676829) (← links)
- The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
- Quantifying knowledge complexity (Q1300608) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- On the knowledge complexity of \(\mathcal N\mathcal P\) (Q1848028) (← links)
- Uniform generation of NP-witnesses using an NP-oracle (Q1854397) (← links)
- On relationships between statistical zero-knowledge proofs (Q1975967) (← links)