No label defined (Q4029586)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 139608
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 139608 |
Statements
28 March 1993
0 references
classifying graphs
0 references
classifying trees
0 references
coloured posets
0 references
Euler-Poincaré characteristic
0 references
classification
0 references
0.748590350151062
0 references
0.7449594736099243
0 references
0.7381147146224976
0 references
0.7367099523544312
0 references
[For the entire collection see Zbl 0745.00057.] One of the most interesting and outstanding problems in theoretical computer science is the determination of the ``small size'' Size(C) of certain classification problems \(C\). Though also the determination of Size\((C)\) is not easy, it can be done in certain cases. Some results concerning these questions are presented. The detailed proofs of these results can be read in \textit{L. Budach} [Klassificationsprobleme und das Verhältnis von deterministischer zu nichtdeterministischer Raumkomplexität, Seminarbericht Nr. 68, Sektion Mathematik der Humboldt-Universität, 1-64 (1985; Zbl 0569.68039)].
0 references
