The following pages link to (Q4941908):
Displaying 4 items.
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields (Q832844) (← links)
- On perfect hashing of numbers with sparse digit representation via multiplication by a constant (Q2275918) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
