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.
- 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)
- Gaussian bounds for noise correlation of resilient functions (Q2303682) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← 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)
- On the approximability of digraph ordering (Q2408167) (← links)
- Inapproximability ratios for crossing number (Q2413159) (← 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)
- Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
- Pricing loss leaders can be hard (Q2637290) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem (Q2661992) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Pareto robust optimization on Euclidean vector spaces (Q2693797) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- (Q2816412) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- Quantum XOR Games (Q2828211) (← 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)
- (Q2941635) (← links)
- (Q2941638) (← links)
- New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← 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)