scientific article; zbMATH DE number 61460
From MaRDI portal
Publication:4009550
Recommendations
Cites work
- A lower bound for read-once-only branching programs
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Bounds for Width Two Branching Programs
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 3913677 (Why is no real title available?)
- scientific article; zbMATH DE number 3928350 (Why is no real title available?)
- scientific article; zbMATH DE number 3987204 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 4045650 (Why is no real title available?)
- scientific article; zbMATH DE number 4051518 (Why is no real title available?)
- scientific article; zbMATH DE number 4061153 (Why is no real title available?)
- scientific article; zbMATH DE number 4102489 (Why is no real title available?)
- Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
- Time-space trade-offs for branching programs
Cited in
(4)- Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
- scientific article; zbMATH DE number 4172378 (Why is no real title available?)
- scientific article; zbMATH DE number 4060726 (Why is no real title available?)
- scientific article; zbMATH DE number 58305 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009550)