FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897777
DOI10.1007/11590156zbMath1172.94461OpenAlexW2484051058MaRDI QIDQ5897777
No author found.
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (2)
Computing unrestricted synopses under maximum error bound ⋮ Finding the minimum number of elements with sum above a threshold
This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
