Pages that link to "Item:Q4884444"
From MaRDI portal
The following pages link to Realization spaces of 4-polytopes are universal (Q4884444):
Displaying 26 items.
- The complete enumeration of 4-polytopes and 3-spheres with nine vertices (Q161299) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- Small grid embeddings of 3-polytopes (Q629826) (← links)
- Finding a simple polytope from its graph in polynomial time (Q1017924) (← links)
- Realizability and inscribability for simplicial polytopes via nonlinear optimization (Q1683692) (← links)
- The universality theorem for neighborly polytopes (Q1705807) (← links)
- Hom-polytopes (Q1944801) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Embedding stacked polytopes on a polynomial-size grid (Q2358818) (← links)
- Combining realization space models of polytopes (Q2690127) (← links)
- Six Topics on Inscribable Polytopes (Q2832782) (← links)
- A note on the existence of a universal polytope among regular 4-polytopes (Q2866522) (← links)
- On the Complexity of the Planar Slope Number Problem (Q2971391) (← links)
- Enumerating Neighborly Polytopes and Oriented Matroids (Q3194584) (← links)
- Realization spaces of 4-polytopes are universal (Q4884444) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- The Complexity of Positive Semidefinite Matrix Factorization (Q5355204) (← links)
- ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPES (Q6072649) (← links)
- The complexity of the Hausdorff distance (Q6145675) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
- The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)
- A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
