The Post correspondence problem over a unary alphabet

Rudnicki, P. and Woeginger, G.J. (2003) The Post correspondence problem over a unary alphabet. Applied Mathematics Letters, 16 (5). pp. 723-727. ISSN 0893-9659

PDF
Restricted to UT campus only: Request a copy
375Kb

Abstract:	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.
Item Type:	Article
Copyright:	©2003 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/45804
Official URL:	http://dx.doi.org/10.1016/S0893-9659(03)00073-9
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 213305