Abstract
Purchase PDF (375 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (236 K)
doi:10.1016/S0893-9659(03)00073-9 
Copyright © 2003 Published by Elsevier Science Ltd.
The post correspondence problem over a unary alphabet
P. Rudnicki
, * and G. J. Woeginger
Communicated by Dr. Masao Iri
Available online 25 August 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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.
Author Keywords: Post correspondence problem; Computational complexity; NP-complete; Pseudopolynomial time algorithm
