scientific article; zbMATH DE number 4193660

MaRDI QIDQ5202180zbMATH OpenFDO

Authors Elias Dahlhaus

Publication date 1989

zbMATH Keywords

canonical labellingcomplexity classesHamilton cyclemaximum cliqueNP-completenesspolynomial time completeness

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 3889514
• The complexity of satisfiability problems
• Logics for complexity classes
• scientific article; zbMATH DE number 3999295
• Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory

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 Q5202180)