Combinatorial group testing algorithms improved for d = 3
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11410%2F23%3A10470354" target="_blank" >RIV/00216208:11410/23:10470354 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=fLqlNphrTF" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=fLqlNphrTF</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.37394/23209.2023.20.47" target="_blank" >10.37394/23209.2023.20.47</a>
Alternative languages
Result language
angličtina
Original language name
Combinatorial group testing algorithms improved for d = 3
Original language description
The aim of this paper is to present an improvement of one well-known method for d = 3. In the original paper two algorithms were presented, one for d = 3 and another (Chinese remainder sieve method) that was modifiable for arbitrary d. In its basic form, the Chinese remainder sieve method was always better than the explicit algorithm for d = 3. In our proposed form, the modified algorithm for d = 3 is more efficient for some small n, and it also pushes the lower bound from which an efficient algorithm exists.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
50301 - Education, general; including training, pedagogy, didactics [and education systems]
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
WSEAS Transactions on Information Science and Applications
ISSN
1790-0832
e-ISSN
2224-3402
Volume of the periodical
20
Issue of the periodical within the volume
1
Country of publishing house
GR - GREECE
Number of pages
3
Pages from-to
453-455
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85181004063