scientific article

From MaRDI portal

Revision as of 13:42, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3334079

Jump to:navigation, search

zbMath0544.68035MaRDI QIDQ3334079

Ingo Wegener

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decision trees branching programs symmetric Boolean functions time-space trade-offs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

A lower bound for read-once-only branching programs ⋮ Polynomial size \(\Omega\)-branching programs and their computational power

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3334079&oldid=16574471"