Pages that link to "Item:Q3579185"
From MaRDI portal
The following pages link to An exponential separation between regular and general resolution (Q3579185):
Displaying 7 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- The depth of resolution proofs (Q647405) (← links)
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- An unexpected separation result in Linearly Bounded Arithmetic (Q4666949) (← links)
