An Optimal Algorithm for Finding Frieze–Kannan Regular Partitions (Q5364234): Difference between revisions

@@ Property / cites work @@
+The Algorithmic Aspects of the Regularity Lemma
@@ Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for graph regularity and removal lemmas
@@ Property / cites work: Bounds for graph regularity and removal lemmas / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
+Normal rank
@@ Property / cites work @@
+A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
+Normal rank
@@ Property / cites work @@
+Quick approximation to matrices and applications
@@ Property / cites work: Quick approximation to matrices and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds of tower type for Szemerédi's uniformity lemma
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Checking Regularity
@@ Property / cites work: An Optimal Algorithm for Checking Regularity / rank @@
+Normal rank
@@ Property / cites work @@
+On sets of integers containing k elements in arithmetic progression
+Normal rank
@@ Property / cites work @@
+Q4200109
@@ Property / cites work: Q4200109 / rank @@
+Normal rank