We continue to investigate input-oblivious computations and build a map of known and new complexity classes. In particular,
* We prove a new upper bound for $OL_2^P$ defined by Hirsch and Volkovich (STACS, 2026), which is a natural input-oblivious version of the $L_2^P$ class of Korten and Pitassi (FOCS, 2024): ... more >>>