scientific article; zbMATH DE number 7561681

DOI10.4230/LIPIcs.MFCS.2019.37MaRDI QIDQ5092398

Michal Garlík

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1905.12372

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

resolutionreflection principlesproof complexityrefutation statements

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The intractability of resolution
• On reducibility and symmetry of disjoint NP pairs.
• On the automatizability of resolution and related propositional proof systems
• Proofs as Games
• The relative efficiency of propositional proof systems
• On Interpolation and Automatization for Frege Systems
• A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution
• NP search problems in low fragments of bounded arithmetic
• Unnamed Item

This page was built for publication: