The following pages link to Kosaku Nagasaka (Q651872):
Displaying 20 items.
- Approximate polynomial GCD over integers (Q651873) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Approximate square-free part and decomposition (Q2229724) (← links)
- (Q2740680) (← links)
- An improvement in the lattice construction process of approximate polynomial GCD over integers (Q2819617) (← links)
- Ruppert Matrix as Subresultant Mapping (Q3508494) (← links)
- A Study on Gröbner Basis with Inexact Input (Q3644104) (← links)
- Seeking better algorithms for approximate GCD (Q4630097) (← links)
- (Q4660703) (← links)
- (Q4703426) (← links)
- Approximate GCD by relaxed NewtonSLRA algorithm (Q5102006) (← links)
- Parametric Greatest Common Divisors using Comprehensive Gröbner Systems (Q5119959) (← links)
- Approximate GCD by bernstein basis, and its applications (Q5145998) (← links)
- Extended QRGCD Algorithm (Q5168480) (← links)
- Computing a structured Gröbner basis approximately (Q5254183) (← links)
- Computer Algebra in Scientific Computing (Q5479247) (← links)
- Towards more accurate separation bounds of empirical polynomials (Q5739504) (← links)
- Conditional Gröbner basis: Gröbner basis detection with parameters (Q6536610) (← links)
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation (Q6615409) (← links)
