Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 2009
- Thang Luu Ba, Laurent Busé, Bernard Mourrain:
Curve/surface intersection problem by means of matrix representations. SNC 2009: 71-78 - Martin Berz, Kyoko Makino:
Rigorous global search using taylor models. SNC 2009: 11-20 - Jingwei Chen, Yong Feng, Xiaolin Qin, Jingzhong Zhang:
Exact polynomial factorization by approximate high degree algebraic numbers. SNC 2009: 21-28 - Guillaume Chèze, Jean-Claude Yakoubsohn, André Galligo, Bernard Mourrain:
Computing nearest Gcd with certification. SNC 2009: 29-34 - Robert M. Corless:
Pseudospectra for exponential polynomial matrices. SNC 2009: 1-2 - Annie A. M. Cuyt, Wen-shin Lee:
Extracting numerical factors of multivariate polynomials from taylor expansions. SNC 2009: 35-44 - André Galligo, Adrien Poteaux:
Continuations and monodromy on random riemann surfaces. SNC 2009: 115-124 - Michael Hemmer, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos, Ioannis Z. Emiris, Menelaos I. Karavelas, Bernard Mourrain:
Experimental evaluation and cross-benchmarking of univariate real solvers. SNC 2009: 45-54 - Hidenao Iwane, Hitoshi Yanami, Hirokazu Anai, Kazuhiro Yokoyama:
An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination. SNC 2009: 55-64 - Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi:
A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions. SNC 2009: 65-70 - Kyoko Makino, Martin Berz:
Rigorous integration of flows and ODEs using taylor models. SNC 2009: 79-84 - Angelos Mantzaflaris, Bernard Mourrain, Elias P. Tsigaridas:
Continued fraction expansion of real roots of polynomial systems. SNC 2009: 85-94 - Hiroshi Murakami:
Application of filter diagonalization method to numerical solution of algebraic equations. SNC 2009: 95-104 - Shin'ichi Oishi:
Error free transformations of floating point numbers and its applications to constructing efficient error free numerical algorithms. SNC 2009: 3-4 - Victor Y. Pan, Brian Murphy, Rhys Eric Rosholt:
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials. SNC 2009: 105-114 - Victor Y. Pan, Guoliang Qian, Ailong Zheng:
Preconditioning, randomization, solving linear systems, eigen-solving, and root-finding. SNC 2009: 5-6 - Philippe P. Pébay, J. Maurice Rojas, David C. Thompson:
Optimization and NP_R-completeness of certain fewnomials. SNC 2009: 133-142 - Sonia Pérez-Díaz, J. Rafael Sendra, Sonia L. Rueda, Juana Sendra:
Parametrization of ε-rational curves: extended abstract. SNC 2009: 199-200 - Xiaolin Qin, Yong Feng, Jingwei Chen, Jingzhong Zhang:
Finding exact minimal polynomial by approximations. SNC 2009: 125-132 - Stefan Ratschan:
Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems. SNC 2009: 7-8 - Tetsuya Sakurai, Junko Asakura, Hiroto Tadano, Tsutomu Ikegami, Kinji Kimura:
A method for finding zeros of polynomial equations using a contour integral based eigensolver. SNC 2009: 143-148 - Masaru Sanuki:
Computing multivariate approximate GCD based on Barnett's theorem. SNC 2009: 149-158 - Tateaki Sasaki, Daiju Inaba:
Convergence and many-valuedness of hensel seriesnear the expansion point. SNC 2009: 159-168 - Tateaki Sasaki, Yasutaka Ookura:
Approximate factorization of polynomials over Z. SNC 2009: 169-176 - Tateaki Sasaki, Akira Terui:
Computing clustered close-roots of univariate polynomials. SNC 2009: 177-184 - Liyong Shen, Min Wu, Zhengfeng Yang, Zhenbing Zeng:
Finding positively invariant sets of a class of nonlinear loops via curve fitting. SNC 2009: 185-190 - Kiyoshi Shirayanagi, Hiroshi Sekigawa:
Reducing exact computations to obtain exact results based on stabilization techniques. SNC 2009: 191-198 - Masaaki Sugihara:
De-Sinc numerical methods. SNC 2009: 9-10 - 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]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-31 13:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint