Sciweavers

TCS
2002
13 years 10 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
CORR
2008
Springer
109views Education» more  CORR 2008»
13 years 11 months ago
New Combinatorial Complete One-Way Functions
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
Arist Kojevnikov, Sergey I. Nikolenko
STACS
1999
Springer
14 years 3 months ago
Decidability and Undecidability of Marked PCP
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
Vesa Halava, Mika Hirvensalo, Ronald de Wolf