A note on the complexity of matching patterns with variables (Q2445237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the complexity of matching patterns with variables |
scientific article; zbMATH DE number 6284213
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of matching patterns with variables |
scientific article; zbMATH DE number 6284213 |
Statements
A note on the complexity of matching patterns with variables (English)
0 references
14 April 2014
0 references
computational complexity
0 references
formal languages
0 references
pattern matching with variables
0 references
parameterised pattern matching
0 references
NP-complete problems
0 references
membership problem for pattern languages
0 references
0 references
0.8898781538009644
0 references
0.8887407183647156
0 references
0.8721003532409668
0 references
0.8624445796012878
0 references
0.8488401770591736
0 references
