Pages that link to "Item:Q899584"

The following pages link to Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584):

Displaying 5 items.

• The complexity of dependency detection and discovery in relational databases (Q2062133) (← links)
• Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
• The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
• (Q5874488) (← links)
• Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)