Pages that link to "Item:Q2474203"
From MaRDI portal
The following pages link to The resolution complexity of independent sets and vertex covers in random graphs (Q2474203):
Displaying 9 items.
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- (Q5092479) (← links)
- Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
