The Invariance Problem for Matrix Semigroups (Q2811359): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-49630-5_28
+Normal rank
@@ Property / OpenAlex ID @@
+W2504887362
@@ Property / OpenAlex ID: W2504887362 / rank @@
+Normal rank
@@ Property / cites work @@
+The boundedness of all products of a pair of matrices is undecidable
+Normal rank
@@ Property / cites work @@
+Reachability in Register Machines with Polynomial Updates
+Normal rank
@@ Property / cites work @@
+UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
+Normal rank
@@ Property / cites work @@
+On the reachability problem for 5-dimensional vector addition systems
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for the orbit problem
@@ Property / cites work: Polynomial-time algorithm for the orbit problem / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel program schemata
@@ Property / cites work: Parallel program schemata / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability Problems for PAMs
@@ Property / cites work: Reachability Problems for PAMs / rank @@
+Normal rank
@@ Property / cites work @@
+REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
+Normal rank
@@ Property / cites work @@
+Q3992465
@@ Property / cites work: Q3992465 / rank @@
+Normal rank
@@ Property / cites work @@
+Developments in Language Theory
@@ Property / cites work: Developments in Language Theory / rank @@
+Normal rank