TFNP characterizations of proof systems and monotone circuits

DOI10.4230/LIPICS.ITCS.2023.30MaRDI QIDQ6610293FDOQ6610293

Authors: Samuel R. Buss, Noah Fleming, Russell Impagliazzo 

Publication date: 25 September 2024

zbMATH Keywords

proof complexitycircuit complexityTFNP

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: TFNP characterizations of proof systems and monotone circuits

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