📣 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.

Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices (2020)

First Author: Emiris I

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.1145/3373207.3404038

Publication URI: http://dx.doi.org/10.1145/3373207.3404038

Type: Conference/Paper/Proceeding/Abstract