Reachability problems in nondeterministic polynomial maps on the integers

We study the reachability problems in various nondeterministic polynomial maps in Zn. We prove that the reachability problem for very simple three-dimensional affine maps (with independent variables) is undecidable and is PSPACE-hard for two-dimensional quadratic maps. Then we show that the complexi...

詳細記述

書誌詳細
主要な著者: Ko, SK, Niskanen, R, Potapov, I
フォーマット: Conference item
出版事項: Springer, Cham 2018

類似資料