Size-space tradeoffs for oblivious computations
type: Item
instance of: scholarly article
title: Size-space tradeoffs for oblivious computations
zbMATH Open document ID: 0515.68043
DOI: 10.1016/0022-0000(83)90021-1
author: David A. Carlson
author: John Savage
published in: Journal of Computer and System Sciences
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3814975
zbMATH Keywords: computational complexity
zbMATH Keywords: trade-off
zbMATH Keywords: circuit size complexity
MaRDI profile type: Publication
full work available at URL: 0022-0000(83)90021-1
OpenAlex ID: W1985880793
cites work: On programming of arithmetic operations
cites work: Q5585020
cites work: On compiling algorithms for arithmetic expressions
cites work: Q4185781
cites work: Shifting Graphs and Their Applications
cites work: Superconcentrators
cites work: On arithmetic expressions and trees
cites work: Q4138141
cites work: Space-time trade-offs on the FFT algorithm
cites work: Time-space tradeoffs for computing functions, using connectivity properties of their circuits
cites work: Q4138137
cites work: Graph-theoretic properties in computational complexity
description: scientific article; zbMATH DE number 3814975