Embeddability of Simplicial Complexes Is Undecidable

doi 10.1137/1.9781611975994.47
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Cores of Simplicial Complexes

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2008English

Saturated Simplicial Complexes

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2005English

On Ptolemaic Metric Simplicial Complexes

Mathematical Proceedings of the Cambridge Philosophical Society
Mathematics
2010English

Reduction Algorithm for Simplicial Complexes

2013English

Simplicial Complexes and Syzygies of Lattice Ideals

Contemporary Mathematics
Mathematics
2001English

DG-categories and Simplicial Bar Complexes

Moscow Mathematical Journal
Mathematics
2010English

TSO-to-TSO Linearizability Is Undecidable

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2017English

The Geometry of Ideal 2-Dimensional Simplicial Complexes

Glasgow Mathematical Journal
Mathematics
2001English

Partially Ordered Sets and Semi-Simplicial Complexes

Bulletin of the Faculty of Science, Ibaraki University. Series A, Mathematics
1972English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy