一个有困难实例的单词问题的清晰呈现的小组
A Finitely presented group whose word problem has sampleable hard instances
摘要：
自然计算问题的困难实例往往是难以捉摸的。在这篇笔记中，我们提出了一个自然决策问题的例子，一个词的问题，为某一特定的群，其困难的情况是很容易找到的。更准确地说，这个问题有一个复杂的核心，可以在线性时间内采样。
英文摘要：
Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More precisely the problem has a complexity core sampleable in linear time.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
