Infinitely generated semigroups and polynomial complexity
Group Theory
2016-05-12 v2 Computational Complexity
Abstract
This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We construct a machine model for the functions in RM_2^P, and evaluation functions. We prove that RM_2^P is not finitely generated, and use this to show separation results for time-complexity.
Cite
@article{arxiv.1503.04610,
title = {Infinitely generated semigroups and polynomial complexity},
author = {J. C. Birget},
journal= {arXiv preprint arXiv:1503.04610},
year = {2016}
}
Comments
17 pages. To appear in International J. of Algebra and Computation