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
补充文件
