Pages that link to "Item:Q4562279"
From MaRDI portal
The following pages link to Deterministic Communication vs. Partition Number (Q4562279):
Displaying 26 items.
- Nondeterministic and randomized Boolean hierarchies in communication complexity (Q2041245) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- On derandomized composition of Boolean functions (Q2281253) (← links)
- Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\) (Q2422767) (← links)
- On the binary and Boolean rank of regular matrices (Q2689370) (← links)
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions (Q2690505) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Structure of Protocols for XOR Functions (Q4605274) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- From Expanders to Hitting Distributions and Simulation Theorems (Q5005099) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- (Q5088887) (← links)
- (Q5089146) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Query-To-Communication Lifting for BPP Using Inner Product (Q5091185) (← links)
- (Q5091781) (← links)
- Communication Complexity of Pairs of Graph Families with Applications (Q5111227) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- (Q5140848) (← links)
- Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- (Q6062152) (← links)
