Planar Convex Codes are Decidable
From MaRDI portal
Publication:6157969
DOI10.1137/22m1511187arXiv2207.06290OpenAlexW4380485656MaRDI QIDQ6157969
Publication date: 22 June 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.06290
Cites Work
- Unnamed Item
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Obstructions to convexity in neural codes
- Every binary code can be realized by convex sets
- On open and closed convex codes
- Embedding dimension phenomena in intersection complete codes
- Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
- Neural Codes, Decidability, and a New Local Obstruction to Convexity
- d-collapsibility is NP-complete for d greater or equal to 4
- What Makes a Neural Code Convex?
- Oriented matroids and combinatorial neural codes
- Algorithms in real algebraic geometry
This page was built for publication: Planar Convex Codes are Decidable