Pages that link to "Item:Q1019749"
From MaRDI portal
The following pages link to Finding a tree structure in a resolution proof is NP-complete (Q1019749):
Displaying 7 items.
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- Universal resolution for NP-complete problems (Q1129008) (← links)
- Finding compact scheme forests in nested normal form is NP-hard (Q1322463) (← links)
- A complexity gap for tree resolution (Q1601038) (← links)
- (Q4511222) (← links)
- (Q5116496) (← links)