default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Sekigawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Hiroshi Sekigawa:
An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance. ACM Commun. Comput. Algebra 57(3): 119-125 (2023)
2010 – 2019
- 2019
- [j22]Kazuki Kondo, Hiroshi Sekigawa
:
Robust computation methods for sparse interpolation of multivariate polynomials. ACM Commun. Comput. Algebra 53(3): 130-133 (2019) - [c12]Yosuke Sato, Hiroshi Sekigawa, Ryoya Fukasaku, Katsusuke Nabeshima:
On Parametric Border Bases. MACIS 2019: 10-15 - 2018
- [j21]Dai Numahata, Hiroshi Sekigawa:
Robust algorithms for sparse interpolation of multivariate polynomials. ACM Commun. Comput. Algebra 52(4): 145-147 (2018) - [c11]Yosuke Sato, Ryoya Fukasaku, Hiroshi Sekigawa:
On Continuity of the Roots of a Parametric Zero Dimensional Multivariate Polynomial Ideal. ISSAC 2018: 359-365 - 2017
- [j20]Dai Numahata, Hiroshi Sekigawa:
An algorithm for symbolic-numeric sparse interpolation of multivariate polynomials whose degree bounds are unknown. ACM Commun. Comput. Algebra 51(1): 18-20 (2017) - [j19]Hiroshi Sekigawa:
The nearest polynomial to multiple given polynomials with a given zero in the real case. Theor. Comput. Sci. 681: 167-175 (2017) - 2016
- [j18]Yasuhito Kawano, Hiroshi Sekigawa:
Quantum Fourier transform over symmetric groups - improved result. J. Symb. Comput. 75: 219-243 (2016) - 2014
- [j17]Yasuhito Kawano, Hiroshi Sekigawa:
Quantum Fourier Transform over Symmetric Groups: Improved Result. ACM Commun. Comput. Algebra 48(3/4): 127-129 (2014) - [c10]Hiroshi Sekigawa:
The nearest polynomial to multiple given polynomials with a given zero. SNC 2014: 144-145 - 2013
- [c9]Yasuhito Kawano, Hiroshi Sekigawa:
Quantum fourier transform over symmetric groups. ISSAC 2013: 227-234 - 2012
- [j16]Hiroshi Sekigawa, Kiyoshi Shirayanagi:
Maximal perturbation for preserving the number of solutions of a polynomial system. ACM Commun. Comput. Algebra 46(3/4): 120-121 (2012) - 2011
- [j15]Hiroshi Sekigawa, Kiyoshi Shirayanagi:
Isolated real zero of a real polynomial system under perturbation. ACM Commun. Comput. Algebra 45(1/2): 131-132 (2011) - [j14]Hiroshi Sekigawa:
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions. J. Symb. Comput. 46(12): 1318-1335 (2011) - 2010
- [j13]Hiroshi Sekigawa, Kiyoshi Shirayanagi:
Solvability of bivariate polynomial systems under perturbation. ACM Commun. Comput. Algebra 44(3/4): 147-148 (2010)
2000 – 2009
- 2009
- [j12]Hiroki Nakayama, Hiroshi Sekigawa:
Determining divisibility between polynomials with inexact coefficients. ACM Commun. Comput. Algebra 43(3/4): 91-94 (2009) - [j11]Kiyoshi Shirayanagi, Hiroshi Sekigawa:
A new method of reducing exact computations to obtain exact results. ACM Commun. Comput. Algebra 43(3/4): 102-104 (2009) - [j10]Hiroshi Sekigawa:
On real factors of real interval polynomials. J. Symb. Comput. 44(7): 908-922 (2009) - [j9]Yumi Nakajima, Yasuhito Kawano, Hiroshi Sekigawa, Masaki Nakanishi, Shigeru Yamashita, Yasuhiko Nakashima:
Synthesis of quantum circuits for d-level systems by using cosine-sine decomposition. Quantum Inf. Comput. 9(5&6): 423-443 (2009) - [c8]Hiroshi Sekigawa:
A Sequence of Nearest Polynomials with Given Factors. ASCM 2009: 141-145 - [c7]Kiyoshi Shirayanagi, Hiroshi Sekigawa:
Reducing exact computations to obtain exact results based on stabilization techniques. SNC 2009: 191-198 - [e1]Hiroshi Kai, Hiroshi Sekigawa, Tateaki Sasaki, Kiyoshi Shirayanagi, Ilias S. Kotsireas:
Symbolic Numeric Computation, SNC '09, Kyoto, Japan - August 03 - 05, 2009. ACM 2009, ISBN 978-1-60558-664-9 [contents] - 2008
- [j8]Yumi Nakajima, Yasuhito Kawano, Hiroshi Sekigawa:
Efficient quantum circuits for approximating the Jones polynomial. Quantum Inf. Comput. 8(5): 489-500 (2008) - [j7]Hiroshi Sekigawa:
The nearest polynomial with a zero in a given domain. Theor. Comput. Sci. 409(2): 282-291 (2008) - [j6]Kiyoshi Shirayanagi, Hiroshi Sekigawa:
A new Gröbner basis conversion method based on stabilization techniques. Theor. Comput. Sci. 409(2): 311-317 (2008) - [c6]Hiroshi Sekigawa:
The nearest polynomial with a zero in a given domain from a geometrical viewpoint. ISSAC 2008: 287-294 - 2007
- [j5]Hiroshi Sekigawa, Kiyoshi Shirayanagi:
On the Location of Pseudozeros of a Complex Interval Polynomial. Math. Comput. Sci. 1(2): 321-335 (2007) - [c5]Hiroshi Sekigawa:
The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval. ASCM 2007: 32-41 - [c4]Hiroshi Sekigawa:
The nearest polynomial with a zero in a given domain. SNC 2007: 190-196 - [c3]Pramook Khungurn, Hiroshi Sekigawa, Kiyoshi Shirayanagi:
Minimum converging precision of the QR-factorization algorithm for real polynomial GCD. ISSAC 2007: 227-234 - [c2]Hiroshi Sekigawa:
On real factors of real interval polynomials. ISSAC 2007: 331-338 - 2006
- [j4]Yumi Nakajima, Yasuhito Kawano, Hiroshi Sekigawa:
A new algorithm for producing quantum circuits using KAK decompositions. Quantum Inf. Comput. 6(1): 67-80 (2006) - [c1]Hiroshi Sekigawa, Kiyoshi Shirayanagi:
Locating real multiple zeros of a real interval polynomial. ISSAC 2006: 310-317 - 2005
- [j3]Yasuhito Kawano, Kinji Kimura, Hiroshi Sekigawa, Masayuki Noro, Kiyoshi Shirayanagi, Masahiro Kitagawa, Masanao Ozawa:
Existence of the Exact CNOT on a Quantum Computer with the Exchange Interaction. Quantum Inf. Process. 4(2): 65-85 (2005)
1990 – 1999
- 1999
- [j2]Hiroshi Sekigawa, Kenji Koyama:
Nonexistence conditions of a solution for the congruence x1k + ... + xsk = N (mod pn). Math. Comput. 68(227): 1283-1297 (1999) - 1997
- [j1]Kenji Koyama, Yukio Tsuruoka, Hiroshi Sekigawa:
On searching for solutions of the Diophantine equation x3 + y3 + z3 = n. Math. Comput. 66(218): 841-851 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
