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
|
類似資料
-
Solving nondeterministic polynomial complete problems optically and the design of its light source
著者:: Zheng, Mengying.
出版事項: (2013) -
Vector reachability problem in SL (2, ℤ)
著者:: Potapov, I, 等
出版事項: (2016) -
Vector and scalar reachability problems in SL(2, Z)
著者:: Potapov, I, 等
出版事項: (2018) -
Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games
著者:: Jovanović, A, 等
出版事項: (2013) -
NONDETERMINISTIC DECISION RULES
著者:: Piotr Paszek
出版事項: (2015-04-01)