Pages that link to "Item:Q3177800"

The following pages link to Approximation Resistance from Pairwise-Independent Subgroups (Q3177800):

Displaying 24 items.

• Approximation resistant predicates from pairwise independence (Q626619) (← links)
• A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
• Approximation in (Poly-) logarithmic space (Q2037114) (← links)
• On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
• New tools and connections for exponential-time approximation (Q2272598) (← links)
• Gaussian bounds for noise correlation of resilient functions (Q2303682) (← links)
• SDP gaps from pairwise independence (Q2913812) (← links)
• Parity is Positively Useless (Q2969637) (← links)
• Proof Complexity Meets Algebra (Q4617977) (← links)
• The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
• (Q5075740) (← links)
• Near-optimal NP-hardness of approximating \textsc{Max} \(k\)-\(\mathrm{CSP}_R\) (Q5077145) (← links)
• Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
• (Q5089260) (← links)
• UG-hardness to NP-hardness by losing half (Q5091753) (← links)
• Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
• Multitasking Capacity: Hardness Results and Improved Constructions (Q5220467) (← links)
• Approximation resistance from pairwise independent subgroups (Q5495815) (← links)
• Simple and local independent set approximation (Q5919021) (← links)
• Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
• Max-3-Lin over non-abelian groups with universal factor graphs (Q6053470) (← links)
• On the Approximability of Presidential Type Predicates (Q6058187) (← links)
• (Q6176154) (← links)
• Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)