P, NP, and the Post correspondence problem

DOI10.1006/inco.1995.1128zbMath0834.68033OpenAlexW1976470420MaRDI QIDQ1899905

Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu

Publication date: 14 November 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1128

zbMATH Keywords

complexity classesPost correspondence problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

ON THE DUAL POST CORRESPONDENCE PROBLEM

This page was built for publication: P, NP, and the Post correspondence problem