Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time.

Vesa Halava Stepan Holub

Published in: Int. J. Found. Comput. Sci. (2024)

Keyphrases

special case
polynomial hierarchy
databases
computational complexity
non binary
worst case
approximation algorithms
transitive closure
np hardness