Reachability problems in low-dimensional nondeterministic polynomial maps over integers (2021)
Attributed to:
Reachability problems for words, matrices and maps: Algorithms and Complexity
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.ic.2021.104785
Publication URI: https://api.elsevier.com/content/abstract/scopus_id/85109952352
Type: Journal Article/Review
Parent Publication: Information and Computation