Topological invariants of classification problems (Q908698): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3938505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform complexity classes, decision graphs and homological properties of posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological approach to evasiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information storage and retrieval systems: Mathematical foundations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5522742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and commutative algebra / rank
 
Normal rank

Latest revision as of 13:19, 20 June 2024

scientific article
Language Label Description Also known as
English
Topological invariants of classification problems
scientific article

    Statements

    Topological invariants of classification problems (English)
    0 references
    0 references
    1990
    0 references
    There is a general agreement that problems which are highly complex in any naive sense are also difficult from the computational point of view. It is therefore of great interest to find invariants and invariant structures which measure in some respect the complexity of the given problem. The question which we are going to consider are classification problems, the ``computations'' are described by questionnaires or, as they are called nowadays, by ``branching programs''. The ``complexity'' of the problem is measured by classical topological invariants (Betti numbers, Euler-Poincaré characteristic) of topological structures (simplicial complexes, topological spaces).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    measure of complexity
    0 references
    classification problems
    0 references
    branching programs
    0 references