The following pages link to (Q4938624):
Displaying 8 items.
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds (Q2430008) (← links)
- A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds (Q3502659) (← links)
- The simplified weighted sum function and its average sensitivity (Q5964818) (← links)
