scientific article
From MaRDI portal
Publication:2934692
zbMath1302.65111MaRDI QIDQ2934692
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity and performance of numerical algorithms (65Y20)
Related Items (10)
A Sparsified Four-Russian Algorithm for RNA Folding ⋮ Logic minimization techniques with applications to cryptology ⋮ Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases ⋮ Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps ⋮ Parsing by matrix multiplication generalized to Boolean grammars ⋮ Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ Edit Distance with Duplications and Contractions Revisited ⋮ The Mailman algorithm: a note on matrix-vector multiplication ⋮ Improved normal form for grammars with one-sided contexts
This page was built for publication:
