Pages that link to "Item:Q1606909"
From MaRDI portal
The following pages link to Linear codes are hard for oblivious read-once parity branching programs (Q1606909):
Displaying 5 items.
- Neither reading few bits twice nor reading illegally helps much (Q1130185) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
- Lower bounds for restricted read-once parity branching programs (Q2503280) (← links)
- Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs (Q4800256) (← links)