Pages that link to "Item:Q869763"
From MaRDI portal
The following pages link to Algorithmic complexity of a problem of idempotent convex geometry. (Q869763):
Displaying 5 items.
- Refinement of two-factor factorizations of a linear partial differential operator of arbitrary order and dimension (Q541965) (← links)
- An interval version of separation by semispaces in max-min convexity (Q550665) (← links)
- On the dimension of max-min convex sets (Q1677643) (← links)
- On hyperplanes and semispaces in max-min convex geometry (Q3585655) (← links)
- (Q5702473) (← links)