The following pages link to (Q4004078):
Displaying 50 items.
- On the size of partial block designs with large blocks (Q2581419) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- DEX: self-healing expanders (Q2629213) (← links)
- The asymptotic behavior of the correspondence chromatic number (Q2629278) (← links)
- Non-degenerate Hilbert cubes in random sets (Q2642767) (← links)
- Probably approximately optimal satisficing strategies (Q2674195) (← links)
- Aspects of the Kahane-Salem-Zygmund inequalities in Banach spaces (Q2681995) (← links)
- A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences (Q2700602) (← links)
- Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
- Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach (Q2971608) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
- Basic Facts about Expander Graphs (Q3088196) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers (Q3095338) (← links)
- Breaking an Identity-Based Encryption Scheme Based on DHIES (Q3104705) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- On the Random Greedy $F$-Free Hypergraph Process (Q3178438) (← links)
- Signed and Minus Dominating Functions in Graphs (Q3384612) (← links)
- Almost Optimal Bounds for Direct Product Threshold Theorem (Q3408186) (← links)
- On Dinur’s proof of the PCP theorem (Q3430210) (← links)
- Threshold Group Testing (Q3439262) (← links)
- Forbidden Intersection Patterns in the Families of Subsets (Introducing a Method) (Q3509403) (← links)
- Arithmetic Progressions and Tic-Tac-Toe Games (Q3530426) (← links)
- On Nonnegative Cosine Polynomials with Nonnegative Integral Coefficients (Q4281751) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns (Q4626557) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- On dependent randomized rounding algorithms (Q4645933) (← links)
- Coloring bipartite hypergraphs (Q4645934) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- A note on the Size-Ramsey number of long subdivisions of graphs (Q4680735) (← links)
- Phase transition in random distance graphs on the torus (Q4684920) (← links)
- Every monotone graph property has a sharp threshold (Q4717065) (← links)
- Discrepancy in arithmetic progressions (Q4874236) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Generating Random Networks Without Short Cycles (Q4971560) (← links)
- Fourier decay for self-similar measures (Q4992913) (← links)
- A quantitative Lovász criterion for Property B (Q4993116) (← links)
- MODp-tests, almost independence and small probability spaces (Q5047166) (← links)
- Eternal domination and clique covering (Q5054057) (← links)
- Hard graphs for randomized subgraph exclusion algorithms (Q5054768) (← links)
- Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
- A view from the bridge spanning combinatorics and probability (Q5054893) (← links)
- The $\chi$-Ramsey Problem for Triangle-Free Graphs (Q5074951) (← links)
- Planarity and Genus of Sparse Random Bipartite Graphs (Q5084098) (← links)
- (Q5091136) (← links)
- Distributed near-optimal matching (Q5101411) (← links)
- An elementary introduction to the geometry of quantum states with pictures (Q5108489) (← links)
