scientific article; zbMATH DE number 7651219
From MaRDI portal
Publication:5874553
DOI10.4230/LIPIcs.ESA.2020.80MaRDI QIDQ5874553
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2008.02769
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Size-depth tradeoffs for Boolean formulae
- An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas
- Verifying candidate matches in sparse and wildcard matching
- Faster Regular Expression Matching
- Efficient string matching
- Fast Pattern Matching in Strings
- A Four Russians algorithm for regular expression pattern matching
- Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
- More Applications of the Polynomial Method to Algorithm Design
- Programming Techniques: Regular expression search algorithm
- Space/time trade-offs in hash coding with allowable errors
This page was built for publication:
