Complexity Classes for Online Problems with and Without Predictions
- 30 June 2025
- book chapter
- Published by Springer Nature
- p. 49-63
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Advice Complexity of Priority AlgorithmsTheory of Computing Systems, 2019
- Online Dominating SetAlgorithmica, 2018
- The Advice Complexity of a Class of Hard Online ProblemsTheory of Computing Systems, 2016
- An Introduction to Online Computation2016
- Information Complexity of Online Problems2010
- On the Advice Complexity of Online Problems2009
- Parameterizing above Guaranteed Values: MaxSat and MaxCutJournal of Algorithms, 1999
- Parameterized Complexity1999
- Complexity and Approximation1999
- Reducibility among Combinatorial Problems1972