Pattern matching with wildcards using words of shorter length
From MaRDI portal
Publication:1675874
DOI10.1016/j.ipl.2010.09.011zbMath1379.68375OpenAlexW2071028907MaRDI QIDQ1675874
Meng Zhang, Yi Zhang, Liang Hu
Publication date: 3 November 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.09.011
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Simple deterministic wildcard matching
- Faster pattern matching with character classes using prime number encoding
- PRIMES is in P
- Approximate formulas for some functions of prime numbers
- Verifying candidate matches in sparse and wildcard matching
- Prime sieves using binary quadratic forms
This page was built for publication: Pattern matching with wildcards using words of shorter length