Pages that link to "Item:Q1598877"
From MaRDI portal
The following pages link to Approximating the independence number and the chromatic number in expected polynomial time (Q1598877):
Displaying 14 items.
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- On-line list colouring of random graphs (Q491533) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
- Concentration of norms and eigenvalues of random matrices (Q1883231) (← links)
- Approximating independent set in perturbed graphs (Q2446304) (← links)
- Wigner random matrices with non-symmetrically distributed entries (Q2473343) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- Approximating Independent Set and Coloring in Random Uniform Hypergraphs (Q3599156) (← links)
- Exact and approximative algorithms for coloring G(n,p) (Q4736774) (← links)
- Eigenvectors of random graphs: Nodal Domains (Q5198670) (← links)
- Concentration for noncommutative polynomials in random matrices (Q5390233) (← links)
- Spectral norm of random matrices (Q5900389) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900936) (← links)
