Pages that link to "Item:Q1201154"
From MaRDI portal
The following pages link to Test complexity of generic polynomials (Q1201154):
Displaying 7 items.
- Verification complexity of linear prime ideals (Q1207526) (← links)
- On the parallel complexity of the polynomial ideal membership problem (Q1271168) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- Use of algebraically independent numbers for zero recognition of polynomial terms. (Q1426048) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- Polynomial size test sets for commutative languages (Q4361579) (← links)
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity (Q5459985) (← links)