Efficient rational proofs for space bounded computations
type: Item
instance of: scholarly article
title: Efficient rational proofs for space bounded computations
zbMATH Open document ID: 1448.68240
DOI: 10.1007/978-3-319-68711-7_4
author: Matteo Campanelli
author: Rosario Gennaro
publication date: 2017-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q06
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6798998
MaRDI profile type: Publication
full work available at URL: 978-3-319-68711-7 4
OpenAlex ID: W2761017788
Recommended article: Q4281496
Recommended article: A framework for space complexity in algebraic proof systems
Recommended article: Q4035721
Recommended article: Beyond Hellman's time-memory trade-offs with applications to proofs of space
Recommended article: Q3975135
Recommended article: Space bounded computations: Review and new separation results
Recommended article: Efficient rational proofs with strong utility-gap guarantees
Recommended article: Q4357061
Recommended article: Q4251070
Recommended article: Space Complexity in Propositional Calculus
description: scientific article; zbMATH DE number 6798998