scientific article; zbMATH DE number 3913677
From MaRDI portal
Publication:3690219
Recommendations
Cited in
(41)- Reduced error pruning of branching programs cannot be approximated to within a logarithmic factor
- An impossibility gap between width-4 and width-5 permutation branching programs
- 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
- On Nečiporuk's theorem for branching programs
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
- Efficient oblivious branching programs for threshold and mod functions
- On uncertainty versus size in branching programs.
- Superlinear lower bounds for bounded-width branching programs
- Proof complexity of monotone branching programs
- Fractional pebbling and thrifty branching programs
- scientific article; zbMATH DE number 5899238 (Why is no real title available?)
- A lower bound for the computational complexity of characteristic functions of BCH-codes by branching programs
- scientific article; zbMATH DE number 4172394 (Why is no real title available?)
- scientific article; zbMATH DE number 3866582 (Why is no real title available?)
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
- scientific article; zbMATH DE number 3928350 (Why is no real title available?)
- Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
- scientific article; zbMATH DE number 4007722 (Why is no real title available?)
- scientific article; zbMATH DE number 4051004 (Why is no real title available?)
- Lower bounds on the complexity of real-time branching programs
- scientific article; zbMATH DE number 4094813 (Why is no real title available?)
- scientific article; zbMATH DE number 17548 (Why is no real title available?)
- scientific article; zbMATH DE number 36617 (Why is no real title available?)
- scientific article; zbMATH DE number 61460 (Why is no real title available?)
- scientific article; zbMATH DE number 176154 (Why is no real title available?)
- scientific article; zbMATH DE number 1304312 (Why is no real title available?)
- Subquadratic Simulations of Balanced Formulae by Branching Programs
- scientific article; zbMATH DE number 1746571 (Why is no real title available?)
- Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.
- scientific article; zbMATH DE number 1408348 (Why is no real title available?)
- A note on amortized branching program complexity
- Stochastic Algorithms: Foundations and Applications
- Branching program size is almost linear in formula size
- On the size of binary decision diagrams representing Boolean functions
- Lower bounds to the complexity of symmetric Boolean functions
- Polynomial size \(\Omega\)-branching programs and their computational power
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 Q3690219)
