Efficient rational proofs for space bounded computations
From MaRDI portal
Publication:1675446
DOI10.1007/978-3-319-68711-7_4zbMATH Open1448.68240OpenAlexW2761017788MaRDI QIDQ1675446
Rosario Gennaro, Matteo Campanelli
Publication date: 27 October 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-68711-7_4
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (9)
Efficient rational proofs with strong utility-gap guarantees ⋮ Fine-grained secure computation ⋮ Simple proofs of space-time and rational proofs of storage ⋮ Structural complexity of rational interactive proofs ⋮ Space bounded computations: Review and new separation results ⋮ Title not available (Why is that?) ⋮ Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency ⋮ A framework for space complexity in algebraic proof systems ⋮ Tight proofs of space and replication
Recommendations
- Space bounded computations: Review and new separation results 👍 👎
- Efficient rational proofs with strong utility-gap guarantees 👍 👎
- Beyond Hellman's time-memory trade-offs with applications to proofs of space 👍 👎
- A framework for space complexity in algebraic proof systems 👍 👎
- Space Complexity in Propositional Calculus 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Efficient rational proofs for space bounded computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675446)
