Complexity and algorithms for Euler characteristic of simplicial complexes

DOI10.1016/j.jsc.2012.07.003zbMath1263.68052arXiv1112.4523OpenAlexW2963061445WikidataQ60246122 ScholiaQ60246122MaRDI QIDQ1930164

Eduardo Sáenz-de-Cabezón, Bjarke Hammersholt Roune

Publication date: 10 January 2013

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.4523

zbMATH Keywords

algorithmscomputational complexitymonomial idealEuler characteristicsimplicial complex\(\#\text{P}\)-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Computational aspects and applications of commutative rings (13P99) Abstract complexes in algebraic topology (55U05) Combinatorial aspects of simplicial complexes (05E45) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Related Items (2)

Evasiveness through binary decision diagrams ⋮ Complexity of simplicial homology and independence complexes of chordal graphs

This page was built for publication: Complexity and algorithms for Euler characteristic of simplicial complexes