A nonadaptive version of Ulam's problem with one lie (Q1360979): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3994535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ulam's searching game with lies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating systems of a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding Theory Applied to a Problem of Ulam / rank
 
Normal rank
Property / cites work
 
Property / cites work: On separating systems whose elements are sets of at most k elements / rank
 
Normal rank

Revision as of 16:36, 27 May 2024

scientific article
Language Label Description Also known as
English
A nonadaptive version of Ulam's problem with one lie
scientific article

    Statements

    A nonadaptive version of Ulam's problem with one lie (English)
    0 references
    0 references
    2 June 1998
    0 references
    Given \(n\) items with one defective, identify the defective with the minimum number of tests each of which tells whether a subset of items contains the defective. This is a group testing problem. Moreover, if at most \(r\) tests are allowed to lie, then the problem is called Ulam's problem with \(r\) lies. In the literature, the minimum number of tests has been determined for Ulam's problem with \(r\) lies for \(r\leq 2\). In this paper, the author considers a nonadaptive version of Ulam's problem with one lie. Lower and upper bounds for the minimum number of tests are obtained.
    0 references
    group testing
    0 references
    Ulam's problem
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references