Universal functions for classes of Boolean polynomials
- Авторы: Voronenko A.A.1
-
Учреждения:
- Department of Computational Mathematics and Cybernetics
- Выпуск: Том 41, № 3 (2017)
- Страницы: 142-144
- Раздел: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176194
- DOI: https://doi.org/10.3103/S0278641917030074
- ID: 176194
Цитировать
Аннотация
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).
Ключевые слова
Об авторах
A. Voronenko
Department of Computational Mathematics and Cybernetics
Автор, ответственный за переписку.
Email: dm6@cs.msu.ru
Россия, Moscow, 119991
Дополнительные файлы
