The following pages link to Vince Grolmusz (Q236918):
Displayed 33 items.
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- Large parallel machines can be extremely slow for small problems (Q807013) (← links)
- Pairs of codes with prescribed Hamming distances and coincidences (Q851769) (← links)
- Incomparability in parallel computation (Q919822) (← links)
- On a Ramsey-theoretic property of orders (Q1199999) (← links)
- Circuits and multi-party protocols (Q1266161) (← links)
- Harmonic analysis, real approximation, and the communication complexity of Boolean functions (Q1283682) (← links)
- The BNS lower bound for multi-party protocols is nearly optimal (Q1327389) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- A note on non-deterministic communication complexity with few witnesses (Q1405785) (← links)
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs (Q1586354) (← links)
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances (Q1865379) (← links)
- Low rank co-diagonal matrices and Ramsey graphs (Q1972674) (← links)
- A note on the PageRank of undirected graphs (Q2345872) (← links)
- The Erdős Webgraph Server (Q2440133) (← links)
- Co-orthogonal codes (Q2491276) (← links)
- (Q2741465) (← links)
- (Q2752469) (← links)
- A weight-size trade-off for circuits with MOD m gates (Q2817598) (← links)
- (Q3439684) (← links)
- Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication (Q3604747) (← links)
- (Q4219029) (← links)
- (Q4230350) (← links)
- (Q4259977) (← links)
- (Q4364578) (← links)
- Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications (Q4429698) (← links)
- (Q4483921) (← links)
- A Note on Explicit Ramsey Graphs and Modular Sieves (Q4655900) (← links)
- Constructing set systems with prescribed intersection sizes (Q4805399) (← links)
- (Q4808632) (← links)
- Lower Bounds for (MOD<i><sub>p</sub></i> - MOD<i><sub>m</sub></i>) Circuits (Q4943864) (← links)
- Set-systems with restricted multiple intersections (Q5958836) (← links)
- Harmonic analysis, real approximation, and the communication complexity of Boolean functions (Q6184658) (← links)