You are here: TUCS > PUBLICATIONS > Publication Search > Binary generalized Post Corres...
- TUCS Publication Series
- How to Publish in TUCS Series
- Publication Search
- Publication Graph
- Publication Input
- Publication Input Guide
- JuFo Browser
Binary generalized Post Correspondence Problem is decidable in polynomial time
Vesa Halava, Stepan Holub, Binary generalized Post Correspondence Problem is decidable in polynomial time. In: 9-ème Conférence Internationale Journées Montoises d'Informatique Théorique, 2002.
BibTeX entry:
@INPROCEEDINGS{pHaHo02a,
title = {Binary generalized Post Correspondence Problem is decidable in polynomial time},
author = {Halava, Vesa and Holub, Stepan},
series = {9-ème Conférence Internationale Journées Montoises d'Informatique Théorique},
year = {2002},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics