scientific article
From MaRDI portal
Publication:3690219
zbMath0572.68033MaRDI QIDQ3690219
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Time-space trade-offs for branching programs ⋮ A lower bound for read-once-only branching programs ⋮ Entropy of contact circuits and lower bounds on their complexity ⋮ Meanders and their applications in lower bounds arguments ⋮ Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) ⋮ Tradeoffs for language recognition on alternating machines ⋮ Efficient oblivious branching programs for threshold and mod functions ⋮ Lower bounds to the complexity of symmetric Boolean functions ⋮ On the size of binary decision diagrams representing Boolean functions ⋮ Unnamed Item ⋮ An impossibility gap between width-4 and width-5 permutation branching programs
This page was built for publication:
