Pages that link to "Item:Q1931431"
From MaRDI portal
The following pages link to Software engineering and complexity in effective algebraic geometry (Q1931431):
Displaying 11 items.
- Quiz games as a model for information hiding (Q272185) (← links)
- Evaluating geometric queries using few arithmetic operations (Q694567) (← links)
- Software for algebraic geometry. Papers of a workshop, Minneapolis, MN, USA, October 23--27, 2006 (Q925696) (← links)
- Probabilistic algorithms for geometric elimination (Q1304992) (← links)
- On the realisability of double-cross matrices by polylines in the plane (Q2396825) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- (Q4806130) (← links)
- On the intrinsic complexity of elimination problems in effective algebraic geometry (Q5501606) (← links)
- Computing Circuit Polynomials in the Algebraic Rigidity Matroid (Q6161559) (← links)
- Methodologies of Symbolic Computation (Q6163846) (← links)
- In memoriam. Succinct obituary in memoriam of Joos Heintz (Q6665427) (← links)