scientific article
From MaRDI portal
Publication:3111411
zbMath1252.68124MaRDI QIDQ3111411
Publication date: 18 January 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityNP-hard problemspolynomial-time computability\(\mathrm{P}=\mathrm{NP}\) problem
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (1)
This page was built for publication: