Pages that link to "Item:Q1917312"

The following pages link to A group testing problem for hypergraphs of bounded rank (Q1917312):

Displaying 13 items.

• Randomized group testing for mutually obscuring defectives (Q293335) (← links)
• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
• An adaptive algorithm for group testing for complexes (Q500957) (← links)
• A revised algorithm for searching for all defective edges in a graph (Q765324) (← links)
• A competitive algorithm in searching for many edges in a hypergraph (Q869578) (← links)
• A group testing problem for graphs with several defective edges (Q1348382) (← links)
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs (Q2369987) (← links)
• A competitive algorithm to find all defective edges in a graph (Q2486071) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing (Q2891340) (← links)
• An Efficient Algorithm for Combinatorial Group Testing (Q4915259) (← links)
• (Q5109048) (← links)
• A Combinatorial Model of Two-Sided Search (Q5895055) (← links)