Pages that link to "Item:Q5259598"

The following pages link to Analytical approach to parallel repetition (Q5259598):

Displaying 50 items.

• How to Keep an Eye on Small Things (Q5012868) (← links)
• Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
• Anchored Parallel Repetition for Nonlocal Games (Q5067446) (← links)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
• Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
• On Polynomial Time Constructions of Minimum Height Decision Tree (Q5091026) (← links)
• (Q5091054) (← links)
• (Q5091070) (← links)
• A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
• (Q5111721) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
• On Partial Covering For Geometric Set Systems (Q5115815) (← links)
• Adaptive Submodular Ranking and Routing (Q5130512) (← links)
• Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
• On Directed Covering and Domination Problems (Q5136265) (← links)
• Optimal matroid partitioning problems (Q5136271) (← links)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
• How to Secure Matchings against Edge Failures (Q5157391) (← links)
• Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)
• Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for $$\mathsf {NP}$$ Secure Against Quantum Adversaries (Q5270368) (← links)
• The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem (Q5384533) (← links)
• Computing and Listing st-Paths in Public Transportation Networks (Q5740180) (← links)
• Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
• A distributed algorithm for a set cover game (Q5866029) (← links)
• (Q5874472) (← links)
• (Q5875460) (← links)
• Monitoring the edges of a graph using distances (Q5896103) (← links)
• Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)
• Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)
• Hardness results of global total \(k\)-domination problem in graphs (Q5918768) (← links)
• Capacitated discrete unit disk cover (Q5918931) (← links)
• Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
• Two dependency constrained spanning tree problems (Q6067892) (← links)
• Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
• (Q6087218) (← links)
• Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
• Controlling entity integrity with key sets (Q6098153) (← links)
• Real-time passenger bus routing problems with preferences and tradeoffs (Q6113072) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
• Safe sets and in-dominating sets in digraphs (Q6153473) (← links)
• Sequence Hypergraphs: Paths, Flows, and Cuts (Q6163626) (← links)
• Justifying groups in multiwinner approval voting (Q6165554) (← links)
• The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
• The work of Mark Braverman (Q6200321) (← links)
• Communication and information complexity (Q6200329) (← links)
• Twenty-two new approximate proof labeling schemes (Q6535018) (← links)