Pages that link to "Item:Q3579218"
From MaRDI portal
The following pages link to On the power of unique 2-prover 1-round games (Q3579218):
Displayed 50 items.
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- A note on unique games (Q845686) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Partial multicuts in trees (Q861281) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
- Finding small stabilizers for unstable graphs (Q896265) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- Gaussian noise sensitivity and Fourier tails (Q1650030) (← links)
- Tight approximation bounds for dominating set on graphs of bounded arboricity (Q1675919) (← links)
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- On the robust hardness of Gröbner basis computation (Q1713027) (← links)
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Random Laplacian matrices and convex relaxations (Q1750385) (← links)
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
- Network pollution games (Q1755784) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Quasimetric embeddings and their applications (Q1799224) (← links)
- Noise correlation bounds for uniform low degree functions (Q1944763) (← links)
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
- On non-optimally expanding sets in Grassmann graphs (Q2048867) (← links)
- Makespan minimization with OR-precedence constraints (Q2059086) (← links)
- On the complexity of fair house allocation (Q2060606) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← links)
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) (Q2105441) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
- On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) (Q2182087) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- Column subset selection is NP-complete (Q2228097) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Metrical service systems with multiple servers (Q2258084) (← links)
- Perspectives on CUR decompositions (Q2300772) (← links)