Pages that link to "Item:Q3191985"

The following pages link to A PCP characterization of NP with optimal amortized query complexity (Q3191985):

Displaying 20 items.

• A self-tester for linear functions over the integers with an elementary proof of correctness (Q315532) (← links)
• Approximability of packing disjoint cycles (Q534781) (← links)
• Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
• A note on unique games (Q845686) (← links)
• Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
• Inapproximability results for equations over infinite groups (Q974745) (← links)
• On the hardness of approximating max-satisfy (Q1045886) (← links)
• Towards optimal lower bounds for clique and chromatic number. (Q1874411) (← links)
• On the approximability of clique and related maximization problems (Q1877696) (← links)
• Inapproximability results for equations over finite groups (Q1884871) (← links)
• On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
• New tools and connections for exponential-time approximation (Q2272598) (← links)
• On the derandomization of the graph test for homomorphism over groups (Q2430014) (← links)
• Contact Center Scheduling with Strict Resource Requirements (Q3009760) (← links)
• Black-Box Reductions in Mechanism Design (Q3088099) (← links)
• Approximation Algorithms for CSPs (Q4993604) (← links)
• The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
• (Q5077145) (← links)
• An Improved Dictatorship Test with Perfect Completeness (Q5136305) (← links)
• Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions (Q5436976) (← links)