scientific article; zbMATH DE number 7650367

DOI10.4230/LIPICS.ITCS.2020.19MaRDI QIDQ5875713zbMATH OpenFDO

Authors Fedor Part, Iddo Tzameret

Publication date 3 February 2023

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

zbMATH Keywords

combinatoricsconcrete lower boundsproof complexityresolutionsatisfiability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Resolution with counting: dag-like lower bounds and different moduli
• Counting the number of equivalent binary resolution proofs
• Counting for satisfiability by inverting resolution
• scientific article; zbMATH DE number 1361471
• A feasibly constructive lower bound for resolution proofs
• Resolution lower bounds for the weak pigeonhole principle
• On exponential lower bounds for partially ordered resolution
• A lower bound on the size of resolution proofs of the Ramsey theorem
• On the complexity of resolution with bounded conjunctions
• scientific article; zbMATH DE number 1929954

Cited in

(4)

• Resolution with counting: dag-like lower bounds and different moduli
• Notes on resolution over linear equations
• Resolution over linear equations modulo two
• scientific article; zbMATH DE number 1522926 (Why is no real title available?)

This page was built for publication:

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