Despite the growing interest in traditional cuisine, to the present author’s knowledge no linguistic analysis of Polish culinary recipes has been conducted so far. Even though numerous studies of recipes written in other languages, such as English, have been published, the structure and typology of early Polish recipes have, as yet, been ignored. The aim of the present paper is to investigate the earliest known Polish collection Compendium Ferculorum, and collate these fi ndings with what is known about this text type from other languages. Such an analysis will show whether the earliest Polish instructions, which appeared relatively late, i.e. in the 17th century, follow the pattern which is typical of the period or rather that of an earlier stage in the evolution of the recipe, as was the case with the earliest American recipes (Dylewski 2016).

The implementations of matrix multiplication on contemporary, vector-oriented, and multicore-oriented computer hardware are very carefully designed and optimized with respect to their efficiency, due to the essential significance of that operation in other science and engineering domains. Consequently, the available implementations are very fast and it is a natural desire to take advantage of the efficiency of those implementations in other problems, both matrix and nonmatrix. Such an approach is often called a black box matrix computation paradigm in the literature on the subject. In this article, we gathered a broad series of algorithms taking advantage of the efficiency of fast matrix multiplication algorithms in other mathematical and computer science operations.