scientific article; zbMATH DE number 6007966

MaRDI QIDQ3115338zbMATH OpenFDO

Authors Vladimir Popov

Publication date 20 February 2012

zbMATH Keywords

NP-completenessparameterized complexitydictionary generation

Mathematics Subject Classification ID

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115338)