Pages that link to "Item:Q5339312"
From MaRDI portal
The following pages link to On a Combinatorial Problem in Number Theory (Q5339312):
Displaying 6 items.
- Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325) (← links)
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← links)
- On the metric dimension of Cartesian powers of a graph (Q2424901) (← links)
- Resolving the hypercube (Q2446831) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- On the dimension of additive sets (Q2939984) (← links)