Year: 2025
Type: article
Abstract: The generic approach to algorithmic problems was proposed by Myasnikov, Kapovich, Schupp, and Spielrein in 2003. This approach studies the behavior of the algorithm not on the entire set of inputs, but on a certain subset (almost all) of the inputs. In this paper, we consider the general complexity of the finite groupoid isomorphism problem and prove that its natural subproblem is generically hard provided that the finite groupoid isomorphism problem is worst-case hard.
Source: Herald of Omsk University
Author: Gorkun
Institution: Omsk State University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4410330240