The following pages link to N-dimensional polyhedron
External toolsShowing 15 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Polyhedron (links | edit)
- Carathéodory's theorem (convex hull) (links | edit)
- Basic feasible solution (links | edit)
- Polyhedron (disambiguation) (links | edit)
- Algorithmic problems on convex sets (links | edit)
- Facet complexity (redirect to section "facetcomplexity") (links | edit)
- Vertex complexity (redirect to section "vertexcomplexity") (links | edit)
- Representation complexity (redirect to section "facetcomplexity") (links | edit)
- Well-described polyhedron (redirect to section "welldescribed") (links | edit)
- Talk:N-dimensional polyhedron (transclusion) (links | edit)
- User:Erel Segal (links | edit)
- User talk:Erel Segal (links | edit)
- Misplaced Pages:WikiProject Polyhedra (links | edit)
- Misplaced Pages:CHECKWIKI/WPC 552 dump (links | edit)
- Misplaced Pages:WikiProject Polyhedra/Books (links | edit)