Hiroshi Sekigawa

Orcid: 0009-0003-1770-0994

According to our database1, Hiroshi Sekigawa authored at least 32 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance.
ACM Commun. Comput. Algebra, September, 2023

2019
Robust computation methods for sparse interpolation of multivariate polynomials.
ACM Commun. Comput. Algebra, 2019

On Parametric Border Bases.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2018
Robust algorithms for sparse interpolation of multivariate polynomials.
ACM Commun. Comput. Algebra, 2018

On Continuity of the Roots of a Parametric Zero Dimensional Multivariate Polynomial Ideal.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
The nearest polynomial to multiple given polynomials with a given zero in the real case.
Theor. Comput. Sci., 2017

An algorithm for symbolic-numeric sparse interpolation of multivariate polynomials whose degree bounds are unknown.
ACM Commun. Comput. Algebra, 2017

2014
Quantum Fourier Transform over Symmetric Groups: Improved Result.
ACM Commun. Comput. Algebra, 2014

The nearest polynomial to multiple given polynomials with a given zero.
Proceedings of the Symbolic-Numeric Computation 2014, 2014

2013
Quantum fourier transform over symmetric groups.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
Maximal perturbation for preserving the number of solutions of a polynomial system.
ACM Commun. Comput. Algebra, 2012

2011
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions.
J. Symb. Comput., 2011

Isolated real zero of a real polynomial system under perturbation.
ACM Commun. Comput. Algebra, 2011

2010
Solvability of bivariate polynomial systems under perturbation.
ACM Commun. Comput. Algebra, 2010

2009
Synthesis of quantum circuits for d-level systems by using cosine-sine decomposition.
Quantum Inf. Comput., 2009

On real factors of real interval polynomials.
J. Symb. Comput., 2009

A new method of reducing exact computations to obtain exact results.
ACM Commun. Comput. Algebra, 2009

Determining divisibility between polynomials with inexact coefficients.
ACM Commun. Comput. Algebra, 2009

Reducing exact computations to obtain exact results based on stabilization techniques.
Proceedings of the Symbolic Numeric Computation, 2009

A Sequence of Nearest Polynomials with Given Factors.
Proceedings of the Computer Mathematics, 2009

2008
A new Gröbner basis conversion method based on stabilization techniques.
Theor. Comput. Sci., 2008

The nearest polynomial with a zero in a given domain.
Theor. Comput. Sci., 2008

Efficient quantum circuits for approximating the Jones polynomial.
Quantum Inf. Comput., 2008

The nearest polynomial with a zero in a given domain from a geometrical viewpoint.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
On the Location of Pseudozeros of a Complex Interval Polynomial.
Math. Comput. Sci., 2007

Minimum converging precision of the QR-factorization algorithm for real polynomial GCD.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval.
Proceedings of the Computer Mathematics, 8th Asian Symposium, 2007

2006
A new algorithm for producing quantum circuits using KAK decompositions.
Quantum Inf. Comput., 2006

Locating real multiple zeros of a real interval polynomial.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005
Existence of the Exact CNOT on a Quantum Computer with the Exchange Interaction.
Quantum Inf. Process., 2005

1999
Nonexistence conditions of a solution for the congruence x1<sup>k</sup> + ... + xs<sup>k</sup> = N (mod p<sup>n</sup>).
Math. Comput., 1999

1997
On searching for solutions of the Diophantine equation x<sup>3</sup> + y<sup>3</sup> + z<sup>3</sup> = n.
Math. Comput., 1997


  Loading...