Pages that link to "Item:Q2947011"
From MaRDI portal
The following pages link to Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011):
Displaying 10 items.
- Exact learning of juntas from membership queries (Q1663645) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- Structure-aware combinatorial group testing: a new method for pandemic screening (Q2169949) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
- How hard is it to satisfy (almost) all roommates (Q5002706) (← links)
- (Q5005098) (← links)
- Bounds and algorithms for generalized superimposed codes (Q6161430) (← links)
