The following pages link to (Q3622253):
Displaying 15 items.
- On the readability of monotone Boolean formulae (Q652622) (← links)
- Generating aspect graphs for nonconvex polyhedra (Q805297) (← links)
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311) (← links)
- Estimating the number of vertices of a polyhedron (Q1607035) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- The Complexity of Vertex Enumeration Methods (Q3313620) (← links)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Forbidden Vertices (Q5252224) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901273) (← links)
- Recognizing read-once functions from depth-three formulas (Q5915579) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Minimal balanced collections and their application to core stability and other topics of game theory (Q6069152) (← links)
- Traversing combinatorial 0/1-polytopes via optimization (Q6602241) (← links)
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems (Q6657241) (← links)