scientific article; zbMATH DE number 7236445
From MaRDI portal
Publication:5115809
DOI10.4230/LIPIcs.SoCG.2018.41zbMath1489.68331MaRDI QIDQ5115809
Pavel Paták, Zuzana Safernová, Xavier Goaoc, Martin Tancer, Uli Wagner
Publication date: 18 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
General topology of complexes (57Q05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of simplicial complexes (05E45) Computational aspects of digital topology (68U03)
Related Items
Decomposable clutters and a generalization of Simon's conjecture ⋮ Hyperplane Neural Codes and the Polar Complex ⋮ Counting shellings of complete bipartite graphs and trees ⋮ Shellings from relative shellings, with an application to NP-completeness ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bruhat order of Coxeter groups and shellability
- How to shell a monoid
- Optimal discrete Morse functions for 2-manifolds
- Einstein structures: Existence versus uniqueness
- Shellings of spheres and polytopes
- Combinatorics and commutative algebra.
- A computationally intractable problem on simplicial complexes
- Decompositions of two-dimensional simplicial complexes
- On the shellability of the order complex of the subgroup lattice of a finite group
- On Lexicographically Shellable Posets
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
- A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm
- Which Spheres are Shellable?
- Shellable nonpure complexes and posets. II
- Convex Polytopes
- Computational Complexity
- Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete
- Computing Optimal Morse Matchings
- The maximum numbers of faces of a convex polytope
- Shellable Decompositions of Cells and Spheres.
- Recognition of collapsible complexes is NP-complete
This page was built for publication:
