Unambiguous parity-query complexity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F25%3A00635633" target="_blank" >RIV/67985840:_____/25:00635633 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1002/rsa.70010" target="_blank" >https://doi.org/10.1002/rsa.70010</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/rsa.70010" target="_blank" >10.1002/rsa.70010</a>
Alternative languages
Result language
angličtina
Original language name
Unambiguous parity-query complexity
Original language description
We give a lower bound of (Formula presented.) on the unambiguous randomized parity-query complexity of the approximate majority problem—that is, on the lowest randomized parity-query complexity of any function over (Formula presented.) whose value is “ (Formula presented.) ” if the Hamming weight of the input is at most (Formula presented.), is “ (Formula presented.) ” if the weight is at least (Formula presented.), and may be arbitrary otherwise.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA25-16311S" target="_blank" >GA25-16311S: Complexity of computation, communication, and search</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2025
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
Random Structures and Algorithms
ISSN
1042-9832
e-ISSN
1098-2418
Volume of the periodical
66
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
e70010
UT code for WoS article
001497708000005
EID of the result in the Scopus database
2-s2.0-105005225562