Pages that link to "Item:Q1916424"
From MaRDI portal
The following pages link to Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424):
Displaying 12 items.
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- On randomized semi-algebraic test complexity (Q1260656) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- How can a complex square root be computed in an optimal way? (Q1918948) (← links)
- Semi-algebraic complexity of quotients and sign determination of remainders (Q2365423) (← links)
- (Q4011324) (← links)
- (Q4232468) (← links)
- (Q4391222) (← links)
- Complexity of deciding connectivity in real algebraic sets (Q5244507) (← links)
- (Q5460918) (← links)