The Identity Problem for Matrix Semigroups in SL2(Z) is NP-complete
- Submitting institution
-
Liverpool John Moores University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 987
- Type
- E - Conference contribution
- DOI
-
10.1137/1.9781611974782.13
- Title of conference / published proceedings
- PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
- First page
- 187
- Volume
- 0
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- January
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 5
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This result solved a long-standing open problem by exactly characterising the complexity of the problem as NP-complete. The problem previously only had an EXPSPACE upper bound by the seminal result of Choffrut and Karhumaki. The paper led to an invited talk at Oxford University (https://www.cs.ox.ac.uk/seminars/verification/previous.html) and a keynote speech at an NBSAN workshop (https://www-users.york.ac.uk/~varg1/yorksemigroup.htm) during autumn 2017. There have been numerous papers building on the results and techniques, such as “On reachability problems for low-dimensional matrix semigroups”, Colcombet et al., ICALP 2019.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
