scientific article; zbMATH DE number 139608

zbMATH Open0760.68030MaRDI QIDQ4029586FDOQ4029586

Authors: Lothar Budach 

Publication date: 28 March 1993

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

Recommendations

• Computational complexity of problems in classification according to a relation matrix
• Classifying the computational complexity of problems
• scientific article; zbMATH DE number 1107550
• Topological invariants of classification problems
• Classification and complexity of problems.

zbMATH Keywords

classificationEuler-Poincaré characteristicclassifying graphsclassifying treescoloured posets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Cited In (7)

• Title not available (Why is that?)
• Classification and complexity of problems.
• Classification from a Computable Viewpoint
• Unsolvability Cores in Classification Problems
• Topological invariants of classification problems
• Classification of binary vectors by stochastic complexity.
• Computational complexity of problems in classification according to a relation matrix

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