Pages that link to "Item:Q495996"

The following pages link to Parameterized complexity analysis for the closest string with wildcards problem (Q495996):

Displaying 5 items.

• Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
• On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
• (Q5111743) (← links)