Pages that link to "Item:Q2732273"

The following pages link to Minimum propositional proof length is NP-hard to linearly approximate (Q2732273):

Displayed 10 items.

• Towards NP-P via proof complexity and search (Q408544) ‎ (← links)
• Special issue in memory of Misha Alekhnovich. Foreword (Q430839) ‎ (← links)
• On finding short resolution refutations and small unsatisfiable subsets (Q820148) ‎ (← links)
• The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) ‎ (← links)
• Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems (Q924541) ‎ (← links)
• Finding a tree structure in a resolution proof is NP-complete (Q1019749) ‎ (← links)
• Pool resolution is NP-hard to recognize (Q1042441) ‎ (← links)
• On the automatizability of resolution and related propositional proof systems (Q1881219) ‎ (← links)
• On the hardness of approximating the min-hack problem (Q2569170) ‎ (← links)
• An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances (Q2980924) ‎ (← links)