scientific article; zbMATH DE number 4193660
From MaRDI portal
Publication:5202180
zbMath0724.03028MaRDI QIDQ5202180
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completenessHamilton cyclemaximum cliquecomplexity classescanonical labellingpolynomial time completeness
Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: