Pages that link to "Item:Q2219057"
From MaRDI portal
The following pages link to Computational complexity of \(k\)-block conjugacy (Q2219057):
Displaying 5 items.
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts (Q494068) (← links)
- Computational complexity of problems for deterministic presentations of sofic shifts (Q2087461) (← links)
- Hardness of conjugacy, embedding and factorization of multidimensional subshifts of finite type (Q2957910) (← links)
- Optimal state amalgamation is NP-hard (Q4968744) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)