Pages that link to "Item:Q924157"
From MaRDI portal
The following pages link to The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157):
Displaying 4 items.
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- Automating Resolution is NP-Hard (Q5133983) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)