The following pages link to Jordan (Q35395):
Displaying 18 items.
- On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases (Q3452415) (← links)
- A near-optimal algorithm for computing real roots of sparse polynomials (Q3452416) (← links)
- LLL reducing with the most significant bits (Q3452418) (← links)
- Covering of surfaces parametrized without projective base points (Q3452419) (← links)
- Linear independence oracles and applications to rectangular and low rank linear systems (Q3452420) (← links)
- Faster relaxed multiplication (Q3452421) (← links)
- Unimodular completion of polynomial matrices (Q3452422) (← links)
- Computational logic: its origins and applications (Q4559535) (← links)
- Formalizing Ordinal Partition Relations Using Isabelle/HOL (Q5094473) (← links)
- The Jordan Curve Theorem, Formally and Informally (Q5448058) (← links)
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields (Q5891054) (← links)
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains (Q5899515) (← links)
- Logspace computations in graph products (Q5899516) (← links)
- Tame decompositions and collisions (Q5899518) (← links)
- Publication:2255397 (← links)
- Publication:3452414 (← links)
- Publication:3452415 (← links)
- Publication:5899516 (← links)