Skachek, Vitaly, juhendajaRiet, Ago-Erik, juhendajaOksner, KristiinaTartu Ülikool. Matemaatika ja statistika instituutTartu Ülikool. Loodus- ja täppisteaduste valdkond2023-06-292023-06-292023https://hdl.handle.net/10062/91160Assume there are two users. They both have some sets of binary vectors of length n and want to compute jointly exclusive-or on the union of their sets. In the proof, we use the method of monochromatic rectangles, which was proposed in A.C. Yao, STOC, 1979. In addition, we establish a connection between the codewords of the Hamming code and sets that determine different monochromatic rectangles.engopenAccessAttribution-NonCommercial-NoDerivatives 4.0 InternationalkommunikatsioonikeerukushajusarvutusHammingi koodvälistav VÕIdistributed computingHamming codeexclusive orbakalaureusetöödvõrguväljaandedcommunication complexitysuhtluskeerukusThesis