Time-space trade-offs for branching programs
type: Item
instance of: scholarly article
title: Time-space trade-offs for branching programs
zbMATH Open document ID: 0593.68038
DOI: 10.1016/0022-0000(86)90004-8
author: Ingo Wegener
published in: Journal of Computer and System Sciences
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3954276
zbMATH Keywords: complexity of branching programs
zbMATH Keywords: Boolean function
MaRDI profile type: Publication
full work available at URL: 0022-0000(86)90004-8
OpenAlex ID: W2013173685
cites work: Q3852212
cites work: Q5545524
cites work: Q3690219
cites work: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
cites work: Q3757396
description: scientific article; zbMATH DE number 3954276