English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The paper discusses the reduction of problems based on Latin squares to the exact cover problem aiming at its subsequent solution using the dancing links algorithm. The former problems include generation of Latin squares and diagonal Latin squares of a general form/with a given normalization, generation of orthogonal Latin and diagonal Latin squares directly/through the set of transversals, obtaining a set of transversals for a given square, forming a subset of disjoint transversals. For each subproblem, we describe in detail the process of forming the corresponding binary coverage matrices. We show that the use of the proposed approach in comparison with the classical one, i.e. the formation of sets of transversals and their coverages using exhaustive enumeration, allows one to increase the effective processing pace of diagonal Latin squares by 2.5–5.6 times. The developed software implementations of the algorithms are used in computational experiments as part of the Gerasim@Home volunteer distributed computing project on the BOINC platform

On polynomial reduction of problems based on diagonal Latin squares to the exact cover problem