Matching sequences of two digits in matrices is hard

TL;DR

This paper introduces a new computational problem involving matching two-digit sequences in matrices with mixed entries and proves that solving this problem is NP-complete, highlighting its computational difficulty.

Contribution

The paper defines a novel sequence matching problem in matrices and establishes its NP-completeness, contributing to complexity theory and matrix pattern matching literature.

Findings

The problem of matching two-digit sequences in matrices is NP-complete.

The problem involves matrices with entries among two digits and others.

NP-completeness proof demonstrates the problem's computational hardness.

Abstract

We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete