Input: | Finite abstract simplicial complex D given by a list
of facets |
---|---|

Output: | Euler characteristic c(D) Î Z |

Status (general): | Open |
---|---|

Status (fixed dim.): | Polynomial time |

It is unknown whether the decision version "c(D) = 0?"
of this problem is in NP. The problem is easy if D is
given by a list of all of its simplices. For fixed dimension, one
can enumerate all simplices of D and compute the Euler
characteristic in polynomial time.
Currently the fastest way to compute the Euler characteristic is
to first generate (the Hasse diagram of) Furthermore, if computing |

Related problems: | 33 |
---|