Implementation of automated classification andefficiency evaluation systems for calculation algorithms of Grobner bases

Yu. A. Blinkov^a, A. A. Mamonov^ab, S. I. Salpagarov<sup>ab

a</sup> Saratov State University
^b Peoples Friendship University of Russia

Abstract: The article is devoted to the study of the computational complexity of the problem of finding the Grobner basis. The paper proposes to classify such tasks according to various criteria: structural complexity; computational characteristics; thematic affiliation. An automated testing system is also described. Special attention is paid to the creation of a universal test formalization system that can be used by various computer algebra systems.

Key words and phrases: Grobner bases, computer algebra, testing system, computational tasks classification.

UDC: 512.714

Received: 29.09.2025