The following pages link to Matthew Brennan (Q512569):
Displaying 11 items.
- Ramsey numbers of trees and unicyclic graphs versus fans (Q512570) (← links)
- Ramsey numbers of trees versus odd cycles (Q726660) (← links)
- Phase transitions for detecting latent geometry in random graphs (Q2210754) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Threshold for detecting high dimensional geometry in anisotropic random geometric graphs (Q6185052) (← links)
- Universality of Computational Lower Bounds for Submatrix Detection (Q6314261) (← links)
- Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness (Q6314324) (← links)
- The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs (Q6315907) (← links)
- Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries (Q6323781) (← links)
- Reducibility and Statistical-Computational Gaps from Secret Leakage (Q6340851) (← links)
- De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions (Q6363763) (← links)