Pages that link to "Item:Q1300607"
From MaRDI portal
The following pages link to On randomized one-round communication complexity (Q1300607):
Displayed 6 items.
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- An information statistics approach to data stream and communication complexity (Q598248) (← links)
- New results for finding common neighborhoods in massive graphs in the data stream model (Q955006) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)