Universal functions for classes of Boolean polynomials
- Authors: Voronenko A.A.1
-
Affiliations:
- Department of Computational Mathematics and Cybernetics
- Issue: Vol 41, No 3 (2017)
- Pages: 142-144
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176194
- DOI: https://doi.org/10.3103/S0278641917030074
- ID: 176194
Cite item
Abstract
The following problem is considered: Find Boolean function f of n variables with the property that, given any polynomial p of degree at most s, there exists a set of n-tuples such that p is the only polynomial of degree at most s taking the same values as f at these n-tuples. It is shown that for any fixed s and sufficiently large n, such a function exists and can be chosen from among those with domains of cardinality that grow as O(ns).
Keywords
About the authors
A. A. Voronenko
Department of Computational Mathematics and Cybernetics
Author for correspondence.
Email: dm6@cs.msu.ru
Russian Federation, Moscow, 119991
Supplementary files
