Strong closure operators on the set of partial Boolean functions

被引：0

作者：

S. S. Marchenkov

机构：

[1] Moscow State University,Faculty of Computational Mathematics and Cybernetics

来源：

Doklady Mathematics | 2008年 / 77卷

关键词：

Boolean Function; Composition Operator; DOKLADY Mathematic; Closure Operator; Logical Formula;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：288 / 289

页数：1

共 50 条

[1] Strong closure operators on the set of partial Boolean functions
Marchenkov, S. S.
DOKLADY MATHEMATICS, 2008, 77 (02) : 288 - 289
[2] Generating cryptographically strong Boolean functions using partial information
Marta Šimovcová
Martin Stanek
Periodica Mathematica Hungarica, 2004, 49 (1) : 119 - 130
[3] Positively closed classes of partial Boolean functions
Marchenkov S.S.
Popova A.A.
Moscow University Computational Mathematics and Cybernetics, 2008, 32 (3) : 147 - 151
[4] Complexity of sequential implementation of partial Boolean functions
L. A. Sholomov
Doklady Mathematics, 2007, 75 : 449 - 452
[5] On a minimization problem for a set of Boolean functions
Chukhrov I.P.
Journal of Applied and Industrial Mathematics, 2015, 9 (03) : 335 - 350
[6] To the problem of expressibility in the algebra of partial Boolean functions
Tarasov V.V.
Problems of Information Transmission, 2005, 41 (01) : 59 - 64
[7] On the interval of strong partial clones of Boolean functions containing Pol({(0, 0), (0, 1), (1, 0)})
Miguel Couceiro
Lucien Haddad
Karsten Schölzel
Tamás Waldhauser
Algebra universalis, 2017, 77 : 101 - 123
[8] Path-Set Induced Closure Operators on Graphs
Slapal, Josef
FILOMAT, 2016, 30 (03) : 863 - 871
[9] The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey
Caspard, N
Monjardet, B
DISCRETE APPLIED MATHEMATICS, 2003, 127 (02) : 241 - 269
[10] The set-theoretical modification of Boolean functions minimax covering method
Rytsar, B
Minziuk, V
MODERN PROBLEMS OF RADIO ENGINEERING, TELECOMMUNICATIONS AND COMPUTER SCIENCE, PROCEEDINGS, 2004, : 46 - 48

← 1 2 3 4 5 →