📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Reachability Problems in Nondeterministic Polynomial Maps on the Integers

First Author: Ko S

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.1007/978-3-319-98654-8_38

Publication URI: http://dx.doi.org/10.1007/978-3-319-98654-8_38

Type: Book Chapter

Book Title: Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings (2018)

Page Reference: 465-477

ISSN: 2662-9275