PPP-completeness and extremal combinatorics

DOI10.4230/LIPICS.ITCS.2023.22MaRDI QIDQ6610285FDOQ6610285

Pavel Hubáček, Alon Rosen, Author name not available (Why is that?), Lukáš Folwarczný, Romain Bourneuf

Publication date: 25 September 2024

zbMATH Keywords

extremal combinatoricstotal search problemsPPP-completeness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (1)

• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024

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)