mwang@watmath.UUCP (mwang) (07/12/83)
_D_E_P_A_R_T_M_E_N_T _O_F _C_O_M_P_U_T_E_R _S_C_I_E_N_C_E
_U_N_I_V_E_R_S_I_T_Y _O_F _W_A_T_E_R_L_O_O
_S_E_M_I_N_A_R _A_C_T_I_V_I_T_I_E_S
_T_H_E_O_R_Y _S_E_M_I_N_A_R
- Wednesday, July 20, 1983.
Dr. M.J. Colbour of the University of Saskatchewan will
speak on ``Analysis Algorithms for Combinatorial
Design: A Survey".
TIME: 1.30 PM
ROOM: MC 5158
ABSTRACT
Balanced Incomplete Block Designs (BIBDs) are employed
in the construction of error-correcting codes and ex-
perimental designs; however, they are usually studied
as a combinatorial structure of interest in their own
right. Problems which have attracted a great deal of
attention include colouring the elements or blocks of a
design, completing partial design, embedding a given
design into a larger one, decomposing designs into
smaller ones and so on. In this talk, we examine the
various algorithms for tackling these problems, focus-
ing on the complexity of such algorithms.
July 12, 1983