Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2016.5
URN: urn:nbn:de:0030-drops-65115
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6511/
Vassilevska Williams, Virginia
RNA-Folding - From Hardness to Algorithms (Invited Talk)
| pdf-format: |
|
Abstract
This is an overview of the invited talk delivered at the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS-2016).
BibTeX - Entry
@InProceedings{vassilevskawilliams:LIPIcs:2016:6511,
author = {Virginia Vassilevska Williams},
title = {{RNA-Folding - From Hardness to Algorithms (Invited Talk)}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {5:1--5:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
year = {2016},
volume = {58},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6511},
URN = {urn:nbn:de:0030-drops-65115},
doi = {10.4230/LIPIcs.MFCS.2016.5},
annote = {Keywords: RNA folding, matrix multiplication}
}
| Keywords: | RNA folding, matrix multiplication | |
| Seminar: | 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 19.08.2016 |
