scientific article; zbMATH DE number 549860
From MaRDI portal
Publication:4287364
Recommendations
Cited in
(19)- A lower bound for read-once-only branching programs
- Almost \(k\)-wise independence and hard Boolean functions.
- BDDs -- design, analysis, complexity, and applications.
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
- Time-space tradeoffs for branching programs
- The complexity of minimizing and learning OBDDs and FBDDs
- On lower bounds for read-\(k\)-times branching programs
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds
- A very simple function that requires exponential size read-once branching programs.
- A simple function that requires exponential size read-once branching programs
- A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3
- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds
- Communication Complexity and Lower Bounds on Multilective Computations
- scientific article; zbMATH DE number 2079872 (Why is no real title available?)
- Randomization and nondeterminism are comparable for ordered read-once branching programs
- The simplified weighted sum function and its average sensitivity
- Streaming and query once space complexity of longest increasing subsequence
- Perspective on complexity measures targeting read-once branching programs
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice
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 Q4287364)
