Computing unrestricted synopses under maximum error bound
From MaRDI portal
Recommendations
- Synthesis with asymptotic resource bounds
- On the complexity of computing error bounds
- Encodings of bounded synthesis
- The unbounded-error communication complexity of symmetric functions
- Program synthesis in the presence of infinite number of inaccuracies
- scientific article; zbMATH DE number 2077170
- On Syntactic versus Computational Views of Approximability
- scientific article; zbMATH DE number 3995082
Cites work
Cited in
(6)- Computing unrestricted synopses under maximum error bound
- Constructing Chebyshev polynomial synopses with greedy strategy
- Finding the minimum number of elements with sum above a threshold
- Inner-Product Based Wavelet Synopses for Range-Sum Queries
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Optimal workload-based weighted wavelet synopses
This page was built for publication: Computing unrestricted synopses under maximum error bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939676)