Refining the Upper Bound for the Cardinality of the Definition Domain of Universal Functions for a Class of Linear Boolean Functions
- 作者: Voronenko A.A.1, Karchmit I.A.1
- 
							隶属关系: 
							- Department of Computational Mathematics and Cybernetics
 
- 期: 卷 43, 编号 4 (2019)
- 页面: 196-197
- 栏目: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176334
- DOI: https://doi.org/10.3103/S0278641919040095
- ID: 176334
如何引用文章
详细
New upper bound 3n is presented for the cardinality of the definition domain of a universal function for a class of linear Boolean functions in which n is the number of variables.
作者简介
A. Voronenko
Department of Computational Mathematics and Cybernetics
							编辑信件的主要联系方式.
							Email: dm6@cs.msu.ru
				                					                																			                												                	俄罗斯联邦, 							Moscow, 119991						
I. Karchmit
Department of Computational Mathematics and Cybernetics
							编辑信件的主要联系方式.
							Email: zalaphitchar@gmail.com
				                					                																			                												                	俄罗斯联邦, 							Moscow, 119991						
补充文件
 
				
			 
						 
						 
					 
						 
						 
				 
  
  
  
  
  电邮这篇文章
			电邮这篇文章  开放存取
		                                开放存取 ##reader.subscriptionAccessGranted##
						##reader.subscriptionAccessGranted## 订阅存取
		                                		                                        订阅存取
		                                					