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):
Displaying 50 items.
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Exact and approximate algorithms for movement problems on (special classes of) graphs (Q338392) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Solution of the propeller conjecture in \(\mathbb R^3\) (Q368772) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- Improved approximation algorithms for projection games (Q513283) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Spectral algorithms for unique games (Q645126) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- On the complexity of the highway problem (Q690481) (← links)
- Large violation of Bell inequalities with low entanglement (Q717112) (← links)
- The ordered covering problem (Q722532) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- 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)
