A \(1/(1-1/k)\)-optimal algorithm for regular expression grouping (Q4926388)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6178666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(1/(1-1/k)\)-optimal algorithm for regular expression grouping |
scientific article; zbMATH DE number 6178666 |
Statements
1/(1-1/<I>k</I>)-Optimal Algorithm for Regular Expression Grouping (English)
0 references
20 June 2013
0 references
regular expression
0 references
deep packet inspection
0 references
grouping algorithm
0 references
local searching
0 references
\(1/(1-1/k)\)-approximation
0 references
0.769757866859436
0 references
0.7511295676231384
0 references
0.7219617962837219
0 references
0.721470057964325
0 references
0.7149468660354614
0 references
