Pages that link to "Item:Q744093"

The following pages link to The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093):

Displayed 19 items.

• On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) ‎ (← links)
• Weighted online problems with advice (Q726104) ‎ (← links)
• The advice complexity of a class of hard online problems (Q1693995) ‎ (← links)
• Reordering buffer management with advice (Q1707821) ‎ (← links)
• On the advice complexity of the online dominating set problem (Q1998864) ‎ (← links)
• Call admission problems on grids with advice (Q2136274) ‎ (← links)
• Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) ‎ (← links)
• Online bin packing with advice of small size (Q2322702) ‎ (← links)
• On the advice complexity of the \(k\)-server problem (Q2396827) ‎ (← links)
• Call admission problems on trees (Q2672603) ‎ (← links)
• Weighted Online Problems with Advice (Q2819501) ‎ (← links)
• Advice Complexity of the Online Search Problem (Q2819505) ‎ (← links)
• Online Graph Coloring Against a Randomized Adversary (Q3177338) ‎ (← links)
• On Energy-Efficient Computations With Advice (Q3196431) ‎ (← links)
• Online Bin Packing with Advice of Small Size (Q3449804) ‎ (← links)
• Treasure Hunt with Advice (Q3460725) ‎ (← links)
• Online Minimum Spanning Tree with Advice (Q5895056) ‎ (← links)
• Advice complexity of priority algorithms (Q5916086) ‎ (← links)
• Online bin covering with advice (Q5925507) ‎ (← links)