ON LINEAR DECOMPOSITION OF BOOLEAN FUNCTIONS

被引：0

作者：

Cheremushkin, A. V. ^{[1
]}

机构：

[1] EMA IS, Moscow, Russia

来源：

PRIKLADNAYA DISKRETNAYA MATEMATIKA | 2016年 / 31卷 / 01期

关键词：

Boolean function; vector space; dual space; simple disjunctive decomposition; iterative disjunctive decomposition;

D O I：

10.17223/20710410/31/4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Disjunctive decompositions of Boolean functions taken after a linear substitution on the set of arguments are considered. For any component of such a decomposition, a notion of a substantial variables subspace is introduced. The main topic of the article is to give some sufficient condition under which the both these subspaces unequally determine each other in a simple disjunctive decomposition of a function having the trivial stabiliser group of shifts. The case of iterative disjunctive decomposition is considered too.

引用

页码：46 / 56

页数：11

共 50 条

[31] JOINT DECOMPOSITION OF A SYSTEM OF VECTOR BOOLEAN FUNCTIONS
ENIN, SV
BIBILO, PN
[J]. AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1979, (01): : 16 - 22
[32] PARALLEL DECOMPOSITION OF A SYSTEM OF PARTIAL BOOLEAN FUNCTIONS
Pottosin, Yu, V
[J]. VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2018, (45): : 83 - 91
[33] DECOMPOSITION OF BOOLEAN FUNCTIONS BASED ON POLYNOMIAL EXPANSION
AVGUL, LV
SUPRUN, VP
[J]. SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1990, 28 (02): : 151 - 156
[34] ON DECOMPOSITION OF A BOOLEAN FUNCTION INTO SUM OF BENT FUNCTIONS
Tokareva, N. N.
[J]. SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2014, 11 : 745 - 751
[35] FAST ALGORITHM FOR PROPER DECOMPOSITION OF BOOLEAN FUNCTIONS
THAYSE, A
[J]. PHILIPS RESEARCH REPORTS, 1972, 27 (02): : 140 - &
[36] Decomposition of Boolean functions by the logic equation decision
Boole, ES
Chapenko, VP
[J]. AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1996, (04): : 43 - 51
[37] On Boolean functions encodable as a single linear Pseudo-Boolean constraint
Smaus, Jan-Georg
[J]. INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, PROCEEDINGS, 2007, 4510 : 288 - 302
[38] On approximation of maximally nonlinear Boolean functions by almost linear functions
Alekseev, V. B.
Omarov, R. R.
[J]. DISCRETE MATHEMATICS AND APPLICATIONS, 2012, 22 (04): : 435 - 443
[39] Boolean Functions on Sn Which Are Nearly Linear
Filmus, Yuval
[J]. DISCRETE ANALYSIS, 2021, : 1 - 27
[40] ON LINEAR DECISION TREES COMPUTING BOOLEAN FUNCTIONS
GROGER, HD
TURAN, G
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 707 - 718

← 1 2 3 4 5 →