The sketching complexity of pattern matching
From MaRDI portal
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Approximation algorithms (68W25)
Recommendations
Cited in
(7)- Lower Bounds for Testing Computability by Small Width OBDDs
- Sparse recovery with partial support knowledge
- Everywhere-Tight Information Cost Tradeoffs for Augmented Index
- Sample complexity bounds on differentially private learning via communication complexity
- Quasi-Periodicity in Streams
- Optimal lower bounds for matching and vertex cover in dynamic graph streams
- scientific article; zbMATH DE number 7758348 (Why is no real title available?)
This page was built for publication: The sketching complexity of pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313029)