The following pages link to (Q4788070):
Displaying 6 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Proofs of two minimum circuit cover conjectures (Q1569041) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- The complexity of minimum difference cover (Q2458927) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- The work of A. A. Razborov (Q4011101) (← links)