Pages that link to "Item:Q2583538"
From MaRDI portal
The following pages link to A very simple function that requires exponential size read-once branching programs. (Q2583538):
Displaying 7 items.
- Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
- Almost \(k\)-wise independence and hard Boolean functions. (Q1401305) (← links)
- On converting CNF to DNF (Q2576880) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- Size of OBDD representation of 2-level redundancies functions (Q5941091) (← links)
- Streaming and query once space complexity of longest increasing subsequence (Q6591455) (← links)
- Perspective on complexity measures targeting read-once branching programs (Q6647765) (← links)
