We already have a subset sum problem which is a prototype of $NP$- complete problem in computer science. We give here a conjecture that a choice function could also give rise to an $NP$- complete problem. For this purpose we apply modular representation theory to computer science.

翻译：我们已经有了一个子集和问题,这是一个计算机科学中完整的问题,即$NP的原型。我们在这里给出了一个假设,即选择功能也会引起$NP的完整问题。为此,我们将模块代表理论应用到计算机科学中。