A ternary search problem on two disjoint sets (Q1627863): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q129729016, #quickstatements; #temporary_batch_1727091579387 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.05.026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2807652950 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Search problems on graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3994535 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4857782 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129729016 / rank | |||
Normal rank | |||
Latest revision as of 13:41, 23 September 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A ternary search problem on two disjoint sets |
scientific article |
Statements
A ternary search problem on two disjoint sets (English)
0 references
3 December 2018
0 references
search theory
0 references
group tests
0 references
complete bipartite graphs
0 references
