No article text was recorded for this version.
geometric realizability complexity
Version 1 of 17 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Geometric Embeddability of Complexes Is ∃ℝ-Complete
- Blog: Geometric Embeddability of Complexes is ∃ℝ-complete
- Blog: Qualitative Reasoning about Directions in Semantic Spaces
- Blog: On the Complexity of Recognizing Nerves of Convex Sets
- Blog: Space Complexity of Euclidean Clustering
- Blog: Communication Complexity of Inner Product in Symmetric Normed Spaces
- Blog: Collapsibility to a subcomplex of a given dimension is NP-complete
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_geometric_realizability_complexity_e4622a4a,
title = {geometric realizability complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/geometric-realizability-complexity/rdr_e4622a4aeb6445b89e553660fc2ed0f5},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_geometric_realizability_complexity_e4622a4a_v1,
title = {geometric realizability complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/geometric-realizability-complexity/rdr_e4622a4aeb6445b89e553660fc2ed0f5/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}