A Finitely presented group whose word problem has sampleable hard instances
Computational Complexity
2016-02-09 v1 Group Theory
Abstract
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.
Cite
@article{arxiv.1602.02432,
title = {A Finitely presented group whose word problem has sampleable hard instances},
author = {Robert H Gilman},
journal= {arXiv preprint arXiv:1602.02432},
year = {2016}
}
Comments
3 pages