Loading [MathJax]/jax/output/SVG/config.js
Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnaya Matematika, 2025, Volume 37, Issue 1, Pages 3–8
DOI: https://doi.org/10.4213/dm1852
(Mi dm1852)
 

Universal functions using powerful oracles

A. A. Voronenko

Lomonosov Moscow State University
References:
Abstract: The paper discusses a method for uniquely defining boolean functions from a certain set using the parity of the number of ones in subcubes of a function that does not belong to this set (the oracle is a parity counter). Functions suitable for such definitions were previously called «universal.» A criterion for the universality of functions for the class of linear functions is proved. The universality of the negation of the sum modulo two for the classes of monotonic and polarizable functions is also proven.
Keywords: Boolean function, universal function, powerful oracle.
Received: 30.10.2024
Document Type: Article
UDC: 519.71
Language: Russian
Citation: A. A. Voronenko, “Universal functions using powerful oracles”, Diskr. Mat., 37:1 (2025), 3–8
Citation in format AMSBIB
\Bibitem{Vor25}
\by A.~A.~Voronenko
\paper Universal functions using powerful oracles
\jour Diskr. Mat.
\yr 2025
\vol 37
\issue 1
\pages 3--8
\mathnet{http://mi.mathnet.ru/dm1852}
\crossref{https://doi.org/10.4213/dm1852}
Linking options:
  • https://www.mathnet.ru/eng/dm1852
  • https://doi.org/10.4213/dm1852
  • https://www.mathnet.ru/eng/dm/v37/i1/p3
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:39
    References:5
    First page:2
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025