Strong vs. weak range avoidance and the linear ordering principle

DOI10.1109/FOCS61266.2024.00089MaRDI QIDQ7286961zbMATH OpenFDO

Authors Oliver Korten, Toniann Pitassi

Publication date 23 June 2026

Full work available at URL https://doi.org/10.1109/FOCS61266.2024.00089

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(2)

• Provably total functions in the polynomial hierarchy
• How to construct random strings

This page was built for publication: Strong vs. weak range avoidance and the linear ordering principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7286961)