Pages that link to "Item:Q1042441"
From MaRDI portal
The following pages link to Pool resolution is NP-hard to recognize (Q1042441):
Displaying 4 items.
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Automating Resolution is NP-Hard (Q5133983) (← links)
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning (Q5387867) (← links)