Pages that link to "Item:Q1685792"
From MaRDI portal
The following pages link to Reachability problem for polynomial iteration is PSPACE-complete (Q1685792):
Displaying 4 items.
- Reachability problems in nondeterministic polynomial maps on the integers (Q1622995) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- A polynomial-time algorithm for reachability in branching VASS in dimension one (Q4598246) (← links)
- On Affine Reachability Problems (Q5089216) (← links)