The following pages link to (Q4230372):
Displaying 14 items.
- The hardness of approximation: Gap location (Q1332662) (← links)
- Ramsey properties of random hypergraphs (Q1380335) (← links)
- Hypergraphs, quasi-randomness, and conditions for regularity (Q1604564) (← links)
- Accuracy criterion for mean field approximations of Markov processes on hypergraphs (Q2111662) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- The correctness of algebraic closures of finite degree of a family of estimate-computing algorithms for regular problems (Q3802666) (← links)
- An algorithmic version of the blow-up lemma (Q4240605) (← links)
- (Q4508358) (← links)
- Testing subgraphs in large graphs (Q4798173) (← links)
- (Q4828944) (← links)
- NOTES ON THE STABLE REGULARITY LEMMA (Q5037518) (← links)
- Regularity Lemmas and Combinatorial Algorithms (Q5171230) (← links)
- Parent-identifying codes (Q5947366) (← links)