Pages that link to "Item:Q2474220"

The following pages link to On undecidability bounds for matrix decision problems (Q2474220):

Displaying 9 items.

• Reachability problems in quaternion matrix and rotation semigroups (Q958311) (← links)
• Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) (Q1740664) (← links)
• Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
• An algebraic view on p-admissible concrete domains for lightweight description logics (Q2055793) (← links)
• Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
• ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735) (← links)
• Reachability Problems for One-Dimensional Piecewise Affine Maps (Q3177337) (← links)
• (Q5111259) (← links)