... follows:{3n /3 ifn==0 (mod 3) ,f(n)=~.3In /31 ifn==1 (mod 3) ,2 .3 In/ 31 ifn==2 (mod 3) .It can be seen thatf(n)=IK-liand 3 1n/41<f(n).It is clear thatn -1 ~IKI ~n+2, 3 1n/41<IK-li.Thus, ... SetNs=UL(Ta).<LERStep 3: Put«;'= {AEN., :lJBEN, :ACB}.Clearly, the steps 2 and 3 of this algorithm require polynomial time in the number of attributes.On the other hand, according to Theorem 2 .3 ... Co.,74(1974) 580-5 83. [2] Beeri C., Bernstein P. A., Computational problems related to the design of normal form rela-tional schemas,ACM Trans. on Database Syst.4 (1) (1979) 30 -59. [3] Beeri C.,DowdM.,...