Hardness of RNA folding problem with four symbols
From MaRDI portal
(Redirected from Hardness of RNA folding problem with four symbols)
Hardness of RNA folding problem with four symbols (scientific article; zbMATH DE number 6792422)
Hardness of RNA folding problem with four symbols (scientific article; zbMATH DE number 6792422)
Recommendations
Cited in
(10)- Hardness of RNA folding problem with four symbols
- If the current clique algorithms are optimal, so is Valiant's parser
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Towards hardness of approximation for polynomial time problems
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- Faster combinatorial \(k\)-clique algorithms
- Faster combinatorial k-clique algorithms
- The role of regularity in (hyper-)clique detection and implications for optimizing Boolean CSPs
- Hardness of dynamic tree edit distance and friends
This page was built for publication: Hardness of RNA folding problem with four symbols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369547)