Reachability in Register Machines with Polynomial Updates
From MaRDI portal
Publication:2849929
DOI10.1007/978-3-642-40313-2_37zbMath1398.68160OpenAlexW94582126MaRDI QIDQ2849929
Stefan Göller, Christoph Haase, Alain Finkel
Publication date: 20 September 2013
Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_37
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Porous invariants, Context-free commutative grammars with integer counters and resets, Polynomial interrupt timed automata: verification and expressiveness, Unnamed Item, Unnamed Item, The Invariance Problem for Matrix Semigroups, Reachability problems in low-dimensional nondeterministic polynomial maps over integers, On Affine Reachability Problems, Unnamed Item