Pages that link to "Item:Q1125616"

The following pages link to Quick approximation to matrices and applications (Q1125616):

Displaying 50 items.

• Szemerédi's regularity lemma via martingales (Q311501) (← links)
• Weak regularity and finitely forcible graph limits (Q322209) (← links)
• Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
• From quasirandom graphs to graph limits and graphlets (Q402587) (← links)
• SVD, discrepancy, and regular structure of contingency tables (Q403553) (← links)
• Linear algebraic methods in communication complexity (Q417541) (← links)
• Testability of minimum balanced multiway cut densities (Q423907) (← links)
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics (Q447926) (← links)
• Approximating sparse binary matrices in the cut-norm (Q498332) (← links)
• The critical window for the classical Ramsey-Turán problem (Q520045) (← links)
• Limits of randomly grown graph sequences (Q648961) (← links)
• The large deviation principle for the Erdős-Rényi random graph (Q648962) (← links)
• Limits of kernel operators and the spectral regularity lemma (Q648972) (← links)
• An analytic approach to stability (Q710597) (← links)
• Cycles of length three and four in tournaments (Q778712) (← links)
• Limits of dense graph sequences (Q859618) (← links)
• Integer and fractional packings of hypergraphs (Q864903) (← links)
• Compact orbit spaces in Hilbert spaces and limits of edge-colouring models (Q896083) (← links)
• Noisy random graphs and their laplacians (Q941350) (← links)
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
• A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
• Finitely forcible graph limits are universal (Q1621473) (← links)
• An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
• Symmetric graph properties have independent edges (Q1641017) (← links)
• The resistance perturbation distance: a metric for the analysis of dynamic networks (Q1693161) (← links)
• Bethe states of random factor graphs (Q1733816) (← links)
• Graph summarization with quality guarantees (Q1741300) (← links)
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence (Q1747754) (← links)
• Testing hypergraph colorability (Q1770424) (← links)
• Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
• Bounds for graph regularity and removal lemmas (Q1930904) (← links)
• Linear dependence between hereditary quasirandomness conditions (Q1991420) (← links)
• Spin systems on Bethe lattices (Q2008960) (← links)
• Consistent nonparametric estimation for heavy-tailed sparse graphs (Q2054468) (← links)
• Multigraph limits, unbounded kernels, and Banach space decorated graphs (Q2056409) (← links)
• Ramsey numbers of books and quasirandomness (Q2095106) (← links)
• Cut distance identifying graphon parameters over weak* limits (Q2120830) (← links)
• Non-bipartite \(k\)-common graphs (Q2151175) (← links)
• Cut norm discontinuity of triangular truncation of graphons (Q2154285) (← links)
• A noncommutative approach to the graphon Fourier transform (Q2168681) (← links)
• Differential calculus on the space of countable labelled graphs (Q2216821) (← links)
• Hyperfinite graphings and combinatorial optimization (Q2220974) (← links)
• Finitely forcible graphons (Q2275893) (← links)
• Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits (Q2312609) (← links)
• Optimal graphon estimation in cut distance (Q2312687) (← links)
• Approximating the rectilinear crossing number (Q2331210) (← links)
• Linear embeddings of graphs and graph limits (Q2347848) (← links)
• A relative Szemerédi theorem (Q2355780) (← links)
• Gaussian bounds for noise correlation of functions (Q2379368) (← links)
• Additive approximation for edge-deletion problems (Q2389218) (← links)