The following pages link to (Q4471994):
Displaying 5 items.
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- On-line vertex-covering (Q1770381) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- On-line models and algorithms for max independent set (Q3411297) (← links)
