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 1 item.
The following pages link to Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386):
Displaying 1 item.