The complexity of linear and stratified context matching problems (Q1764421)
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 2138499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of linear and stratified context matching problems |
scientific article; zbMATH DE number 2138499 |
Statements
The complexity of linear and stratified context matching problems (English)
0 references
24 February 2005
0 references
stratified simultaneous monadic context matching
0 references
stratified simultaneous word matching
0 references
0.7795993685722351
0 references
0.7778969407081604
0 references
0.7672193050384521
0 references
