Memory-tight reductions
type: Item
instance of: scholarly article
title: Memory-tight reductions
zbMATH Open document ID: 1407.94076
DOI: 10.1007/978-3-319-63688-7_4
author: Benedikt Auerbach
author: David Cash
author: Manuel Fersch
author: Eike Kiltz
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6802610
zbMATH Keywords: memory
zbMATH Keywords: tightness
zbMATH Keywords: provable security
zbMATH Keywords: black box reduction
MaRDI profile type: Publication
Wikidata QID: Q59163630
full work available at URL: 978-3-319-63688-7 4
OpenAlex ID: W2741724173
Recommended article: Memory lower bounds of reductions revisited
Recommended article: Limited memory space dilation and reduction algorithms
Recommended article: A polynomial-time algorithm for memory space reduction
Recommended article: Memory-efficient fixpoint computation
Recommended article: Q3202957
Recommended article: Q4428335
Recommended article: Linear Time and Memory-Efficient Computation
Recommended article: Q3685210
Recommended article: Reducing Memory Requirements in Scientific Computing and Optimal Control
description: scientific article; zbMATH DE number 6802610