The following pages link to (Q2734988):
Displaying 12 items.
- Quiz games as a model for information hiding (Q272185) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- On the geometry of polar varieties (Q2267371) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- On the realisability of double-cross matrices by polylines in the plane (Q2396825) (← links)
- A concise proof of the Kronecker polynomial system solver from scratch (Q2427141) (← links)
- Lower complexity bounds for interpolation algorithms (Q2431336) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials (Q3576571) (← links)
- (Q5389777) (← links)
