An introduction to NP-completeness in fuzzy context

MaRDI QIDQ4962804zbMATH OpenFDO

Authors Ajith S. Kurup, Mathews M. George

Publication date 5 November 2018

zbMATH Keywords

deterministic algorithmfuzzy algorithmfuzzy operationsfuzzy setsfuzzy Turing machinenondeterministic algorithmNPNP-completenessNP-hardnessPpolynomial time

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Overview of some solved NP-complete problems in graph theory
• A study on the efficient approximation algorithms for NP-complete problems
• scientific article; zbMATH DE number 4011937
• scientific article; zbMATH DE number 3902037
• scientific article; zbMATH DE number 3926663

This page was built for publication: An introduction to NP-completeness in fuzzy context

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