scientific article; zbMATH DE number 139608

MaRDI QIDQ4029586zbMATH OpenFDO

Authors Lothar Budach

Publication date 28 March 1993

zbMATH Keywords

classificationEuler-Poincaré characteristicclassifying graphsclassifying treescoloured posets

Mathematics Subject Classification ID

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

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.

Cited in

(7)

• scientific article; zbMATH DE number 4020249 (Why is no real title available?)
• 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)