&

2 * 1993

519.713

..

F ,
F , - *
. F
1(F) ( )
2 F.
L(n)
L(n) = max 1(F),
F .
L(n).
1.
P0(F) - F =

F(xlyx2,...,xn),

= ( 1 , 2 ,..., ). /-
0, xi PC(F)
, - , 1 ^ / ^ .
. Poo...o(F)
( -)
P(F), F Q(F).
, f(xux2,x3)

- 3 v 23

P(f) = 2 0 3 0 23 Q(f) = 1 0 ^ 0 3 0 23.

( ) PG(F) d(PG(F)),
( ) PC(F) - s(P0(F)).
F- F(xx,x2,...,xn)
2
(F).
F
, .. s(Pc(F)) = s . s
.., 1993
111

 F *S s(F) ^ . , s(F) = n
, F
. F = 1 s(F) = 0.
F,
, ( F)
Pmm(F).
Fc ,
= F(xlyx2>...,xn)

= ({,2,...,

).

2.

Pmin(F)
F. - ,
2
F .
[1].
[1] , /-
2 -
PG(F), - /-1 / = 1,
2,...,2. ,
1(F).
Pmm(F) F = F(xlyx2,...,xn)
.
2.1. PG(F) -

F, P(Fa) F0.
. ()
, F a , ,
Pa(F)~ P(Fa), .. PG(F) (0)
[2].
2.1

.
2.2. PG(F) s,
1(F) = , - PG (F) 1 ^ /* ^ Csn.
. 5 - -
, . P0(F) P(F)
, PG(F) s,
s
(). d(Ps(F)) ^ d(P0(F)) = /(F) = .
112

, d(P(F*)) = 2n -d. ,
F = xlx2...xnP(F*).

(4.2)

F* = F* = 1, , Q{F) 1 2.
F(F) * Pm\n(F)y = 2.
F*&0 * 1. /^
. , , \ -
F*. , P(F*)

P(F*) = P(Fl)xlP(F2\

(4.3)

F[y F2 2,3>..., F2 ^ 0 .
, d(P(F{)) + d(P(F2)) = d(P(F*)) = 2 - d. F 2 ^0,

d(P(F2))^l.

= (1, 0,...,0) - ,2,...,

P0(F). d(P0(F)) (4.2) (4.3), ..

P0(F) = xlx2...xnxlP(F2)P(Fl)
= xl(x2...xnP(F2))P(F3)

d(P(F3))^

xlx2...xn

xlP(F4)@P(F3\

d(P(Fl) + d(P(F2)) = 2n -dn

d(P(F4))^2n~l

~d(P(F2))^2n~l-I.

, d(P0(F))^ 3 2n~l
-d-l.
dy
d(P0(F))<d(P(F)\

.. -2' -d-\<d.

, d ^ 3 - 2 n ~ 2 , P(F)

d(P0(F))^

^ 3-2 ~ , PG(F) .
, , P0(F) d^ -2~2
. , 2.1,
P(FG) = Pm[n(F0), d(P(FG)) = d(P0(F))^3-2~2.

, ,
3 2~ ,
. .
5. L(n)
,
51(2 = Sl-2(xl,x2,x3)

, .. L(3) 5= 5. (4.1) - , L(3) ^ 5, L (3) = 5.

(3.1) (4.1) = 4 - 5, , 6 ^ 4 ) ^
^1110^5)^23.
, ,
, 114

 [1], , L(4) = 1 0 .
,
10, 5 2 = S2

(1,2,3,4).

, , S lj4 =
Sl4(xl,x2,x3,x4,x5)
20.
20^5)^23.

-1841,
"Mazovia" IBM PC XT/AT.

/) ,

() -

[4].

. L(n)
() ()
. , L(3)
= 5,
-
, 3 ,
5 1 .
/) ( ^ 5)

.

1. a r k i n g B . Efficient algorithm for canonical Reed-Muller expansions of Boolean functions //
IEE Proc. E. - 1990. - V. 137. 5. - P. 366-370.
2. ..
// Elektronische Informationsverarbeitung und Kybernetik. - 1987. V. 23, 4/5. - P . 209-216.
3. .. //
. . - 1985. - 4. - . 123-127.
4. S a s ., s s 1 i h P. On the complexity of mod-2 sum PLA's // IEEE Trans, on Comput. 1990. - V. 39, 2. - P. 262-266.
5. .., . . . .: , 1977. - 368 .
16.12.91

115