PPP-completeness and extremal combinatorics

DOI10.4230/LIPICS.ITCS.2023.22MaRDI QIDQ6610285zbMATH OpenFDO

Authors Romain Bourneuf, Lukáš Folwarczný, Pavel Hubáček, Alon Rosen

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2023.22

zbMATH Keywords

extremal combinatoricsPPP-completenesstotal search problems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
• The \(\mathtt{PPP}\)-completeness of Ward-Szabó

This page was built for publication: PPP-completeness and extremal combinatorics

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