The following pages link to (Q4287364):
Displaying 14 items.
- A simple function that requires exponential size read-once branching programs (Q287023) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds (Q2430008) (← links)
- A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds (Q3502659) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- Randomization and nondeterminism are comparable for ordered read-once branching programs (Q4571952) (← links)
- The simplified weighted sum function and its average sensitivity (Q5964818) (← links)
