scientific article

zbMATH Open1314.03050MaRDI QIDQ2939032

A. G. Abajyan

Publication date: 16 January 2015

Title of this publication is not available (Why is that?)

zbMATH Keywords

proof complexityresolution over linear equationsdeterminative conjunctquasi-hard determinative formularesolution of systemsplit tree

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• Title not available (Why is that?) 👍 👎
• Proof of Kuhn's polynomial conjectures 👍 👎
• Sylow's theorem in polynomial time 👍 👎
• Some complete and intermediate polynomials in algebraic complexity theory 👍 👎
• Cutting-plane proofs in polynomial space 👍 👎
• A polynomial version of Cereceda's conjecture 👍 👎
• Polynomial size proofs of the propositional pigeonhole principle 👍 👎
• Pólya's Theorem and Its Progeny 👍 👎
• Polynomial-time versions of Sylow's theorem 👍 👎
• Proofs as Polynomials 👍 👎

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 Q2939032)