English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product

Bringmann, K., Grandoni, F., Saha, B., & Vassilevska Williams, V. (2019). Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM Journal on Computing, 48(2), 481-512. doi:10.1137/17M112720X.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0003-A7E4-F Version Permalink: https://hdl.handle.net/21.11116/0000-0003-A7E5-E
Genre: Journal Article
Latex : Truly Subcubic Algorithms for Language Edit Distance and {RNA} Folding via Fast Bounded-Difference Min-Plus Product
Other : sub-cubic

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Author           
Grandoni, Fabrizio2, Author           
Saha, Barna2, Author
Vassilevska Williams, Virginia2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20192019
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bringmann_Truly2019
DOI: 10.1137/17M112720X
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: SIAM Journal on Computing
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: 48 (2) Sequence Number: - Start / End Page: 481 - 512 Identifier: ISSN: 0097-5397
CoNE: https://pure.mpg.de/cone/journals/resource/954925466249