The following pages link to Nicholas J. A. Harvey (Q389941):
Displaying 35 items.
- UNO is hard, even for a single player (Q389942) (← links)
- A note on the discrepancy of matrices with bounded row and column sums (Q488272) (← links)
- On the complexity of reconfiguration problems (Q631762) (← links)
- Deterministic SkipNet (Q2390251) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Generating Random Spanning Trees via Fast Matrix Multiplication (Q2802966) (← links)
- (Q2921704) (← links)
- (Q2934625) (← links)
- Discrepancy Without Partial Colorings (Q2969622) (← links)
- (Q2999653) (← links)
- On Disjoint Common Bases in Two Matroids (Q3225155) (← links)
- (Q3549615) (← links)
- Algebraic Algorithms for Matching and Matroid Problems (Q3558018) (← links)
- (Q3579449) (← links)
- Lower bounds for asymmetric communication channels and distributed source coding (Q3581533) (← links)
- The complexity of matrix completion (Q3581565) (← links)
- On the Complexity of Reconfiguration Problems (Q3596704) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Computing the Independence Polynomial: from the Tree Threshold down to the Roots (Q4607991) (← links)
- (Q4633864) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- Sparse Sums of Positive Semidefinite Matrices (Q4962206) (← links)
- Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes (Q5056446) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- A generalization of the Cauchy-Schwarz inequality involving four vectors (Q5249853) (← links)
- (Q5351904) (← links)
- Pipage Rounding, Pessimistic Estimators and Matrix Concentration (Q5384030) (← links)
- A general framework for graph sparsification (Q5419076) (← links)
- Learning submodular functions (Q5419150) (← links)
- Semi-matchings for bipartite graphs and load balancing (Q5491460) (← links)
- (Q5501272) (← links)
- On the capacity of information networks (Q5900528) (← links)
- Algorithms and Data Structures (Q5900762) (← links)
- Optimal anytime regret with two experts (Q6062702) (← links)
- Tight analyses for subgradient descent. I: Lower bounds (Q6633273) (← links)
