Pages that link to "Item:Q1109754"

The following pages link to Entropy of contact circuits and lower bounds on their complexity (Q1109754):

Displaying 12 items.

• A simple function that requires exponential size read-once branching programs (Q287023) (← links)
• Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
• Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
• Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
• A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
• Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
• Randomized OBDD-based graph algorithms (Q1625606) (← links)
• A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds (Q2430008) (← links)
• A hierarchy result for read-once branching programs with restricted parity nondeterminism (Q2566039) (← links)
• A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
• Randomized OBDD-Based Graph Algorithms (Q3460720) (← links)
• Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256) (← links)