Pages that link to "Item:Q4005386"
From MaRDI portal
The following pages link to Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386):
Displaying 5 items.
- Mathematical problems for the next century (Q1582494) (← links)
- (Q3395298) (← links)
- (Q3980333) (← links)
- A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets (Q4910822) (← links)
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities (Q5388004) (← links)