Pages that link to "Item:Q3575151"
From MaRDI portal
The following pages link to Conditional Hardness for Approximate Coloring (Q3575151):
Displaying 39 items.
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
- Hypercontractive inequalities via SOS, and the Frankl-Rödl graph (Q2826231) (← links)
- New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
- Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (Q2968149) (← links)
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors (Q2968154) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- Improved inapproximability results for maximum \(k\)-colorable subgraph (Q3191580) (← links)
- Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- Kneser graphs are like Swiss cheese (Q4645027) (← links)
- Query-Efficient Dictatorship Testing with Perfect Completeness (Q4933378) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- (Q5090458) (← links)
- (Q5092401) (← links)
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)
- Finding Pseudorandom Colorings of Pseudorandom Graphs (Q5136329) (← links)
- (Q5212563) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- (Q5743433) (← links)
- (Q5870293) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Approximately coloring graphs without long induced paths (Q5915792) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- Two generalizations of proper coloring: hardness and approximability (Q6168932) (← links)
- (Q6176154) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023 (Q6613402) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)
