Pages that link to "Item:Q1356937"
From MaRDI portal
The following pages link to How good are convex hull algorithms? (Q1356937):
Displaying 8 items.
- On the no-signaling approach to quantum nonlocality (Q5245222) (← links)
- Forbidden Vertices (Q5252224) (← links)
- Accelerating Fourier–Motzkin elimination using bit pattern trees (Q5865333) (← links)
- Generating all vertices of a polyhedron is hard (Q5920505) (← links)
- Using multiobjective optimization to map the entropy region (Q5963309) (← links)
- Partial identification in nonseparable binary response models with endogenous regressors (Q6108266) (← links)
- Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square (Q6204466) (← links)
- Double description method revisited (Q6567674) (← links)
