Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
347 18 |
Ultima descărcare din IBN: 2024-02-28 13:12 |
Căutarea după subiecte similare conform CZU |
004.627:519.61 (1) |
Date (108) |
Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
SM ISO690:2012 CORLAT, Sergiu, GUZUN, Veaceslav, VORONA, Victor. Finding N bits using $O(\frac{N}{\log N})$ sums. In: Acta et commentationes (Ştiinţe Exacte și ale Naturii), 2022, nr. 2(14), pp. 101-105. ISSN 2537-6284. DOI: https://doi.org/10.36120/2587-3644.v14i2.101-105 |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Acta et commentationes (Ştiinţe Exacte și ale Naturii) | ||||||
Numărul 2(14) / 2022 / ISSN 2537-6284 /ISSNe 2587-3644 | ||||||
|
||||||
DOI:https://doi.org/10.36120/2587-3644.v14i2.101-105 | ||||||
CZU: 004.627:519.61 | ||||||
Pag. 101-105 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The problem we are trying to solve sounds as follows: You are given $N$ bits. Find the value of each bit. We will show a technique which enables finding the values of $N$ bits using $O(\frac{N}{\log N})$ subsequence-sum queries. The algorithm consists of two phases: Constructing the queries for each layer and using the queries for a particular layer to get the value of every bit. We described the following technique in this blog [1], which was inspired by this article [2]. It should be noted that this number of queries is indeed the optimal one for finding all $N$ bits of a binary array, since each subsequence-sum queries offers us at most $\log_{2} N$ bits of information. |
||||||
Cuvinte-cheie binary array, query problem, divide et impera, optimization, șir binar, problemă de interogare, divide et impera, optimizare |
||||||
|