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.
- 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)
- 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)
- 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)
- 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)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Noise correlation bounds for uniform low degree functions (Q1944763) (← links)
- Complexity and approximation of the minimum recombinant haplotype configuration problem (Q2371806) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- Gaussian bounds for noise correlation of functions (Q2379368) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality (Q2472722) (← links)
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \) (Q2475406) (← links)
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem (Q2507699) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs (Q2868655) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- (Q2913811) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)