Pages that link to "Item:Q1208411"
From MaRDI portal
The following pages link to The computational complexity of universal hashing (Q1208411):
Displaying 12 items.
- The average sensitivity of bounded-depth circuits (Q290255) (← links)
- A note on the decoding complexity of error-correcting codes (Q845843) (← links)
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
- Pseudorandom generators for space-bounded computation (Q1204523) (← links)
- Time-space tradeoffs for branching programs (Q1604208) (← links)
- Input locality and hardness amplification (Q1946597) (← links)
- Tight time-space lower bounds for finding multiple collision pairs and their applications (Q2055617) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Authenticating ad hoc networks by comparison of short digests (Q2482445) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- A subquadratic algorithm for 3XOR (Q5005162) (← links)
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)
