Pages that link to "Item:Q5741754"
From MaRDI portal
The following pages link to The communication complexity of addition (Q5741754):
Displaying 4 items.
- A discrepancy lower bound for information complexity (Q343867) (← links)
- One-round multi-party communication complexity of distinguishing sums (Q391326) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
