Pages that link to "Item:Q1350995"
From MaRDI portal
The following pages link to A comparison of two lower-bound methods for communication complexity (Q1350995):
Displayed 18 items.
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- The corruption bound, log-rank, and communication complexity (Q1621501) (← links)
- The augmentation property of binary matrices for the binary and Boolean rank (Q1668986) (← links)
- Fooling sets and the spanning tree polytope (Q1705643) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Ordered biclique partitions and communication complexity problems (Q2342387) (← links)
- Fooling-sets and rank (Q2346587) (← links)
- The rectangle covering number of random Boolean matrices (Q2363099) (← links)
- The (minimum) rank of typical fooling-set matrices (Q2399380) (← links)
- On the complexity of Boolean matrix ranks (Q2435409) (← links)
- Some improved bounds on communication complexity via new decomposition of cliques (Q2636816) (← links)
- Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) (Q2988848) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Communication Complexity and Lower Bounds on Multilective Computations (Q4265538) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- Bipartite perfect matching as a real polynomial (Q6065237) (← links)
- Probabilism versus Alternation for Automata (Q6163621) (← links)