A note on the complexity of matching patterns with variables (Q2445237): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2013.06.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972596784 / rank | |||
Normal rank | |||
Revision as of 23:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the complexity of matching patterns with variables |
scientific article |
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
