On the k-Hamming and k-Edit Distances.

Chiara Epifanio, Luca Forlizzi,Francesca Marzi,Filippo Mignosi,Giuseppe Placidi, Matteo Spezialetti

CoRR（2023）

引用 0|浏览5

暂无评分

摘要

In this paper we consider the weighted $k$-Hamming and $k$-Edit distances, that are natural generalizations of the classical Hamming and Edit distances. As main results of this paper we prove that for any $k\geq 2$ the DECIS-$k$-Hamming problem is $\mathbb{P}$-SPACE-complete and the DECIS-$k$-Edit problem is NEXPTIME-complete.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要