Continuous-time orbit problems are decidable in polynomial-time (Q458374): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1972422534
@@ Property / OpenAlex ID: W1972422534 / rank @@
+Normal rank
@@ Property / cites work @@
+The Orbit Problem Is in the GapL Hierarchy
@@ Property / cites work: The Orbit Problem Is in the GapL Hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Q3998726
@@ Property / cites work: Q3998726 / rank @@
+Normal rank
@@ Property / cites work @@
+The continuous Skolem-Pisot problem
@@ Property / cites work: The continuous Skolem-Pisot problem / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
+Normal rank
@@ Property / cites work @@
+The orbit problem in higher dimensions
@@ Property / cites work: The orbit problem in higher dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139838
@@ Property / cites work: Q3139838 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability in Linear Dynamical Systems
@@ Property / cites work: Reachability in Linear Dynamical Systems / rank @@
+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 @@
+Positivity Problems for Low-Order Linear Recurrence Sequences
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:458374