Title of article
The post correspondence problem over a unary alphabet Original Research Article
Author/Authors
P Rudnicki، نويسنده , , G.J. Woeginger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
5
From page
723
To page
727
Abstract
We consider the problem of finding a shortest solution for the Post correspondence problem over a unary alphabet. We show that the complexity of this problem heavily depends on the representation of the input: the problem is NP-complete if the input is given in compact (logarithmic) form, whereas it becomes polynomially solvable if the input is encoded in unary.
Keywords
Post Correspondence Problem , Computational complexity , Pseudopolynomial time algorithm , NP-complete
Journal title
Applied Mathematics Letters
Serial Year
2003
Journal title
Applied Mathematics Letters
Record number
897564
Link To Document