Kosaku Nagasaka

According to our database, Kosaku Nagasaka authored at least 24 papers between 2002 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation.

Kosaku Nagasaka

J. Symb. Comput., 2025

2023

Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters.

Kosaku Nagasaka, Ryo Oshimatani

ACM Commun. Comput. Algebra, September, 2023

SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials.

Kosaku Nagasaka

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2021

Toward the best algorithm for approximate GCD of univariate polynomials.

Kosaku Nagasaka

J. Symb. Comput., 2021

Approximate square-free part and decomposition.

Kosaku Nagasaka

J. Symb. Comput., 2021

Approximate GCD by relaxed NewtonSLRA algorithm.

Kosaku Nagasaka

ACM Commun. Comput. Algebra, 2021

Relaxed NewtonSLRA for Approximate GCD.

Kosaku Nagasaka

Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020

Approximate GCD by bernstein basis, and its applications.

Kosaku Nagasaka

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2017

Seeking better algorithms for approximate GCD.

Kosaku Nagasaka

ACM Commun. Comput. Algebra, 2017

Parametric Greatest Common Divisors using Comprehensive Gröbner Systems.

Kosaku Nagasaka

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016

Special issue on the conference ISSAC 2014: Symbolic computation and computer algebra.

Kosaku Nagasaka, Ágnes Szántó, Franz Winkler

J. Symb. Comput., 2016

2013

Revisiting QRGCD and comparison with ExQRGCD.

Kosaku Nagasaka, Takaaki Masui

ACM Commun. Comput. Algebra, 2013

Extended QRGCD Algorithm.

Kosaku Nagasaka, Takaaki Masui

Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2012

Backward error analysis of approximate Gröbner basis.

Kosaku Nagasaka

ACM Commun. Comput. Algebra, 2012

2011

An improvement in the lattice construction process of approximate polynomial GCD over integers.

Kosaku Nagasaka

Proceedings of the SNC 2011, 2011

Computing a structured Gröbner basis approximately.

Kosaku Nagasaka

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2009

A Study on Gröbner Basis with Inexact Input.

Kosaku Nagasaka

Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

2008

Approximate polynomial GCD over integers.

Kosaku Nagasaka

ACM Commun. Comput. Algebra, 2008

2007

SNAP package for Mathematica.

Kosaku Nagasaka

ACM Commun. Comput. Algebra, 2007

Ruppert Matrix as Subresultant Mapping.

Kosaku Nagasaka

Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2005

Towards More Accurate Separation Bounds of Empirical Polynomials II.

Kosaku Nagasaka

Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

On the Degeneracy Conditions of Singularities by Using Comprehensive Gröbner Bases.

Tadashi Takahashi, Kosaku Nagasaka

Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2004

Towards more accurate separation bounds of empirical polynomials.

Kosaku Nagasaka

SIGSAM Bull., 2004

2002

Towards certified irreducibility testing of bivariate approximate polynomials.

Kosaku Nagasaka

Proceedings of the Symbolic and Algebraic Computation, 2002