scientific article; zbMATH DE number 6007966

zbMATH Open1249.68082MaRDI QIDQ3115338FDOQ3115338

Authors: Vladimir Popov 

Publication date: 20 February 2012

Title of this publication is not available (Why is that?)

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)