ℹ️
🇬🇧
Search
Search for publications relevant for "Simplicial Complex"
Simplicial Complex
Publication
Class
Person
Publication
Programmes
Export current view
publication
Hardness of Embedding Simplicial Complexes in R^d
2009 |
Faculty of Mathematics and Physics
publication
LC reductions yield isomorphic simplicial complexes
2008 |
Faculty of Mathematics and Physics
publication
Hardness of embedding simplicial complexes in R^d
2011 |
Faculty of Mathematics and Physics
publication
Hardness of almost embedding simplicial complexes in R^d
2019 |
Faculty of Mathematics and Physics
publication
Recognition of Collapsible Complexes is NP-Complete
2016 |
Faculty of Mathematics and Physics
publication
Embeddability in the 3-sphere is decidable
2014 |
Faculty of Mathematics and Physics
publication
SHELLINGS AND SHEDDINGS INDUCED BY COLLAPSES
2021 |
Faculty of Mathematics and Physics
publication
d-collapsibility is NP complete for d greater or equal to 4
2010 |
Faculty of Mathematics and Physics
publication
Shellability is NP-complete
+1
2019 |
Faculty of Mathematics and Physics
publication
A Counterexample to Wegner's Conjecture on Good Covers
2012 |
Faculty of Mathematics and Physics
publication
Strong d-collapsibility
2011 |
Faculty of Mathematics and Physics
publication
Non-Embeddability of Geometric Lattices and Buildings
2014 |
Faculty of Mathematics and Physics
publication
Embeddability in R-3 is NP-hard
2020 |
Faculty of Mathematics and Physics
publication
Combinatorial Alexander Duality - a Short and Elementary Proof
2009 |
Faculty of Mathematics and Physics
publication
NERVES OF GOOD COVERS ARE ALGORITHMICALLY UNRECOGNIZABLE
2013 |
Faculty of Mathematics and Physics
publication
d-collapsibility is NP-complete for d greater or equal to 4
2009 |
Faculty of Mathematics and Physics
publication
Non-representability of finite projective planes by convex sets
2010 |
Faculty of Mathematics and Physics
publication
Bounding Radon number via Betti numbers
2020 |
Faculty of Mathematics and Physics
publication
Extendability of Continuous Maps Is Undecidable
2014 |
Faculty of Mathematics and Physics
publication
Binary linear codes, dimers and hypermatrices
2017 |
Faculty of Mathematics and Physics
publication
Algorithmic Solvability of the Lifting-Extension Problem
2017 |
Faculty of Mathematics and Physics
publication
Embeddability in the 3-Sphere Is Decidable
2018 |
Faculty of Mathematics and Physics
publication
Computing all maps into a sphere
+1
2012 |
Faculty of Mathematics and Physics
publication
Embeddability in R3 is NP-hard
2018 |
Faculty of Mathematics and Physics
publication
POLYNOMIAL-TIME COMPUTATION OF HOMOTOPY GROUPS AND POSTNIKOV SYSTEMS IN FIXED DIMENSION
2014 |
Faculty of Mathematics and Physics
publication
Dimension gaps between representability and collapsibility
2009 |
Faculty of Mathematics and Physics
publication
Bounding Helly numbers via Betti numbers
2015 |
Faculty of Mathematics and Physics
publication
A Stepping-Up Lemma for Topological Set Systems
2021 |
Faculty of Mathematics and Physics