Inproceedings,
Computing the Nearest Rank-Deficient Matrix Polynomial.
M. Giesbrecht, J. Haraldson, and G. Labahn.ISSAC, page 181-188. ACM, (2017)
Meta data
- BibTeX key
- conf/issac/GiesbrechtHL17
- entry type
- inproceedings
- booktitle
- ISSAC
- year
- 2017
- pages
- 181-188
- publisher
- ACM
- crossref
- conf/issac/2017
- ee
- https://doi.org/10.1145/3087604.3087648
- isbn
- 978-1-4503-5064-8
- url
- http://dblp.uni-trier.de/db/conf/issac/issac2017.html#GiesbrechtHL17
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/issac/GiesbrechtHL17
%A Giesbrecht, Mark
%A Haraldson, Joseph
%A Labahn, George
%B ISSAC
%D 2017
%E Burr, Michael A.
%E Yap, Chee K.
%E Din, Mohab Safey El
%I ACM
%K dblp
%P 181-188
%T Computing the Nearest Rank-Deficient Matrix Polynomial.
%U http://dblp.uni-trier.de/db/conf/issac/issac2017.html#GiesbrechtHL17
%@ 978-1-4503-5064-8
@inproceedings{conf/issac/GiesbrechtHL17,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Giesbrecht, Mark and Haraldson, Joseph and Labahn, George},
biburl = {https://www.bibsonomy.org/bibtex/23642e3af1c10b2c06aaebbffd7d5ed8e/dblp},
booktitle = {ISSAC},
crossref = {conf/issac/2017},
editor = {Burr, Michael A. and Yap, Chee K. and Din, Mohab Safey El},
ee = {https://doi.org/10.1145/3087604.3087648},
interhash = {1cffb6ce53254d3ec9303e0a19ac067b},
intrahash = {3642e3af1c10b2c06aaebbffd7d5ed8e},
isbn = {978-1-4503-5064-8},
keywords = {dblp},
pages = {181-188},
publisher = {ACM},
timestamp = {2018-11-07T13:35:29.000+0100},
title = {Computing the Nearest Rank-Deficient Matrix Polynomial.},
url = {http://dblp.uni-trier.de/db/conf/issac/issac2017.html#GiesbrechtHL17},
year = 2017
}