Pages that link to "Item:Q2458927"
From MaRDI portal
The following pages link to The complexity of minimum difference cover (Q2458927):
Displaying 8 items.
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Computing runs on a general alphabet (Q903195) (← links)
- Covering a set with arithmetic progressions is NP-complete (Q910219) (← links)
- An algorithm for the difference between set covers (Q944712) (← links)
- On the complexity of constructing Golomb rulers (Q1028469) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- (Q4788070) (← links)