助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[2181]条 当前为第21条到40条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
boolean
On the greatest length of a dead-end disjunctive normal form for almost all Boolean functions
      
The maximal numberl(f) of conjunctions in a dead-end disjunctive normal form (d.n.f.) of a Boolean functionf and the numberτ (f) of dead-end d.n.f.
      
It is shown that for almost all Boolean functionsl(f)2n-1, log2τ(f)2n-1log2nlog2log2n (n→∞).
      
It is proved that a compactly generated lattice with unique complements is also Boolean.
      
Specific Boolean functionsfn,t(x1,...,xn) are described and a high lower bound of the complexity of calculations using functional elements is obtained for them.
      
Exact upper bounds for the complexity of absolute tests checking the correctness of inputs of logic diagrams realizing Boolean functions which are essentially dependent on n variables have been found for n ≥ 136.
      
Non-self-equivalent constructivization of atomic Boolean algebras
      
In the paper we prove that any constructivizable infinite atomic Boolean algebra has ?0 non-self-equivalent constructivizations.
      
It is proved that on a normed denumerably complete Boolean algebra each continuous exterior measure majorizes at least one measure.
      
Estimation of the length and the number of dead-end disjunctive normal forms for almost all partial boolean functions
      
Constructive boolean algebras with almost-identical automorphisms
      
Elementary theories of free topo-Boolean and pseudo-Boolean algebras
      
Recursive Boolean algebras with a hyperhyperimmune set of atoms
      
On constructivizability of Boolean algebras with a selected subalgebra
      
A propositional logic of Boolean recursive programs in which predicate variables appear in conditions
      
Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits
      
Approximative evaluation of the height of the maximal upper zero of a monotone Boolean function
      
On representation of finite pseudo-Boolean algebras and one of its applications
      
Annihilator characterizations of Boolean rings and Boolean lattices
      
Factorization of an automorphism of a complete boolean algebra into a product of three involutions
      
 

首页上一页12345下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社