Nonuniform complexity classes, decision graphs and homological properties of posets.
Lothar BudachBernd GrawPublished in: Symposium on Computation Theory (1984)
Keyphrases
- algebraic structures
- partially ordered sets
- decision problems
- computational complexity
- graph matching
- decision rules
- decision making
- tractable cases
- graph properties
- desirable properties
- computational cost
- complexity measures
- object recognition
- directed graph
- structural properties
- graph theory
- worst case
- spanning tree
- graph partitioning
- graph theoretic
- topological information
- np hard
- betti numbers
- neural network