Hiroshi Sekigawa
Orcid: 0009-0003-1770-0994
According to our database1,
Hiroshi Sekigawa
authored at least 32 papers
between 1997 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance.
ACM Commun. Comput. Algebra, September, 2023
2019
ACM Commun. Comput. Algebra, 2019
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019
2018
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
ACM Commun. Comput. Algebra, 2014
Proceedings of the Symbolic-Numeric Computation 2014, 2014
2013
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013
2012
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
ACM Commun. Comput. Algebra, 2011
2010
ACM Commun. Comput. Algebra, 2010
2009
Synthesis of quantum circuits for d-level systems by using cosine-sine decomposition.
Quantum Inf. Comput., 2009
ACM Commun. Comput. Algebra, 2009
ACM Commun. Comput. Algebra, 2009
Reducing exact computations to obtain exact results based on stabilization techniques.
Proceedings of the Symbolic Numeric Computation, 2009
Proceedings of the Computer Mathematics, 2009
2008
Theor. Comput. Sci., 2008
Quantum Inf. Comput., 2008
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008
2007
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
Proceedings of the Computer Mathematics, 8th Asian Symposium, 2007
2006
Quantum Inf. Comput., 2006
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006
2005
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