Pages that link to "Item:Q287023"

The following pages link to A simple function that requires exponential size read-once branching programs (Q287023):

Displaying 12 items.

• Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
• A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
• Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
• Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus (Q1416118) (← links)
• A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs (Q1575258) (← links)
• Time-space tradeoffs for branching programs (Q1604208) (← links)
• Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
• A very simple function that requires exponential size read-once branching programs. (Q2583538) (← links)
• Size of OBDD representation of 2-level redundancies functions (Q5941091) (← links)
• The simplified weighted sum function and its average sensitivity (Q5964818) (← links)
• Streaming and query once space complexity of longest increasing subsequence (Q6591455) (← links)
• Perspective on complexity measures targeting read-once branching programs (Q6647765) (← links)