Publication:4918894

zbMath1286.68231MaRDI QIDQ4918894

Anna Gorbenko, V. Yu. Popov

Publication date: 7 May 2013

Full work available at URL: http://www.m-hikari.com/ams/ams-2012/ams-57-60-2012/index.html

zbMATH Keywords

NP-completeness; logical models; parameterized pattern matching

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03D15: Complexity of computation (including implicit computational complexity)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W32: Algorithms on strings