Pages that link to "Item:Q5230344"
From MaRDI portal
The following pages link to Clique is hard on average for regular resolution (Q5230344):
Displaying 10 items.
- Proof complexity of modal resolution (Q832717) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- (Q5092479) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)
