Pages that link to "Item:Q5259598"
From MaRDI portal
The following pages link to Analytical approach to parallel repetition (Q5259598):
Displaying 15 items.
- Scalable anytime algorithms for learning fragments of linear temporal logic (Q6535567) (← links)
- Approximation algorithm for minimum \(q\)-dominator partization problem (Q6542935) (← links)
- Minimization problems with non-submodular cover constraint (Q6542984) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Online multiset submodular cover (Q6582377) (← links)
- Lower bounds of functions on finite abelian groups (Q6591628) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q6610089) (← links)
- Distributed domination on sparse graph classes (Q6614403) (← links)
- Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)
- On approximating partial scenario set cover (Q6652422) (← links)
- More on the complexity of defensive domination in graphs (Q6657275) (← links)
- Near-optimal distributed dominating set in bounded arboricity graphs (Q6658821) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)