The following pages link to (Q4418120):
Displaying 24 items.
- Obstructions to shellability, partitionability, and sequential Cohen-Macaulayness (Q533342) (← links)
- Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← links)
- Algorithmic complexity of a problem of idempotent convex geometry. (Q869763) (← links)
- Mixed-up trees: the structure of phylogenetic mixtures (Q942916) (← links)
- Some algorithmic problems for projective planes (Q1073331) (← links)
- Polymatroids: Construction and random algorithms (Q1179434) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- An orderly algorithm and some applications in finite geometry (Q1584240) (← links)
- Complexity and algorithms for Euler characteristic of simplicial complexes (Q1930164) (← links)
- Shellings from relative shellings, with an application to NP-completeness (Q2046454) (← links)
- Recognizing Cartesian products of matrices and polytopes (Q2056923) (← links)
- Which nonnegative matrices are slack matrices? (Q2435500) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Partitioning the projective plane and the dunce hat (Q2674561) (← links)
- Reachability of weakly nonlinear systems using Carleman linearization (Q2695489) (← links)
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes (Q2804545) (← links)
- Algorithms for the frame of a finitely generated unbounded polyhedron (Q2892275) (← links)
- (Q4246745) (← links)
- (Q4518986) (← links)
- (Q4886261) (← links)
- Shellability is NP-complete (Q5115809) (← links)
- Eigenpolytope Universality and Graphical Designs (Q6195955) (← links)
- Slack matrices, \(k\)-products, and 2-level polytopes (Q6558684) (← links)
- Recognition of Seifert fibered spaces with boundary is in NP (Q6663178) (← links)
