String Matching: Communication, Circuits, and Learning.
From MaRDI portal
Recommendations
- Fast string matching in stationary ergodic sources
- On the complexity of learning strings and sequences
- From coding theory to efficient pattern matching
- scientific article; zbMATH DE number 3845091
- On string pattern matching: A quantitative analysis and a proposal
- String matching: The ergodic case
- Communication and Streaming Complexity of Approximate Pattern Matching
Cites work
- Boolean function complexity. Advances and frontiers.
- Communication Complexity
- Exact and Approximate Pattern Matching in the Streaming Model
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 524134 (Why is no real title available?)
- scientific article; zbMATH DE number 1995129 (Why is no real title available?)
- scientific article; zbMATH DE number 872005 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- Lower bounds in communication complexity
- Neural circuits for pattern recognition with small total wire length.
- On Graph Complexity
- On learning visual concepts and DNF formulae
- On small depth threshold circuits
- On the distributional complexity of disjointness
- On the Worst-Case Behavior of String-Searching Algorithms
- Parallel computation with threshold functions
- Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
- The equation \(a_ M=b^ Nc^ P\) in a free group
- The optimal sample complexity of PAC learning
- The Probabilistic Communication Complexity of Set Intersection
- Threshold circuits of bounded depth
- Top-down lower bounds for depth-three circuits
This page was built for publication: String Matching: Communication, Circuits, and Learning.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875515)
