The following pages link to (Q3994535):
Displaying 29 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Learning Boolean halfspaces with small weights from membership queries (Q329608) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- Rounds in combinatorial search (Q378259) (← links)
- On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges (Q411849) (← links)
- Minimum average-case queries of \(q+1\)-ary search game with small sets (Q412374) (← links)
- Learning a hidden graph (Q479267) (← links)
- Finding at least one excellent element in two rounds (Q538153) (← links)
- The plurality problem with three colors and more. (Q557833) (← links)
- Learning a hidden uniform hypergraph (Q683922) (← links)
- Computing majority with triple queries (Q690459) (← links)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325) (← links)
- A revised algorithm for searching for all defective edges in a graph (Q765324) (← links)
- Selecting two different defective coins (Q849821) (← links)
- A competitive algorithm in searching for many edges in a hypergraph (Q869578) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- Binary trees with choosable edge lengths (Q989581) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Searching for an edge in a graph with restricted test sets (Q1024439) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- Edge search in graphs with restricted test sets (Q1045083) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Realizability and uniqueness in graphs (Q1344609) (← links)
- The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables (Q1578507) (← links)
- A ternary search problem on two disjoint sets (Q1627863) (← links)
- Minimax trees in linear time with applications (Q1761500) (← links)
- On searching strategies, parallel questions, and delayed answers (Q1765232) (← links)
- On binary search trees (Q2366072) (← links)
