Остановите войну!
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 33 matches
- 2014
- Ruyong Feng, Wen-shin Lee, Yosuke Sato:
Computer Mathematics, 9th Asian Symposium (ASCM 2009), Fukuoka, Japan, December 2009, 10th Asian Symposium (ASCM 2012), Beijing, China, October 2012, Contributed Papers and Invited Talks. Springer 2014, ISBN 978-3-662-43798-8 [contents] - 2012
- Brice Boyer, Matthew T. Comer, Erich L. Kaltofen:
Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations. ASCM 2012: 183-197 - Liangyu Chen, Tuo Leng, Liyong Shen, Min Wu, Zhengfeng Yang, Zhenbing Zeng:
Finding the Symbolic Solution of a Geometric Problem Through Numerical Computations. ASCM 2012: 223-241 - Changbo Chen, Marc Moreno Maza:
An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions. ASCM 2012: 199-221 - Mark Giesbrecht, Nam Pham:
A Symbolic Approach to Compute a Null-Space Basis in the Projection Method. ASCM 2012: 243-259 - Jingjun Han:
A Simple Quantifier-Free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms. ASCM 2012: 261-274 - Joris van der Hoeven:
Overview of the Mathemagix Type System. ASCM 2012: 397-425 - Erich L. Kaltofen:
Symbolic Computation and Complexity Theory Transcript of My Talk. ASCM 2012: 3-7 - Na Lei, Xiaopeng Zheng, Yuxue Ren:
The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures. ASCM 2012: 275-296 - Yaohui Li, Yuqing Song, Zhifeng Wu:
Signature-Based Method of Deciding Program Termination. ASCM 2012: 297-310 - Xuefeng Liu, Tomoaki Okayama, Shin'ichi Oishi:
High-Precision Eigenvalue Bound for the Laplacian with Singularities. ASCM 2012: 311-323 - Marc Moreno Maza, Rong Xiao:
Degree and Dimension Estimates for Invariant Ideals of \(P\) -Solvable Recurrences. ASCM 2012: 349-373 - Michael B. Monagan, Roman Pearce:
POLY: A New Polynomial Data Structure for Maple 17. ASCM 2012: 325-348 - Josef Schicho:
Factorization of Motions. ASCM 2012: 9-11 - Fei Shen, Wenyuan Wu, Bican Xia:
Real Root Isolation of Polynomial Equations Based on Hybrid Computation. ASCM 2012: 375-396 - Xiaoli Wu:
Resultant-Free Computation of Indefinite Hyperexponential Integrals. ASCM 2012: 427-435 - Jing Yang, Dongming Wang, Hoon Hong:
ImUp: A Maple Package for Uniformity-Improved Reparameterization of Plane Curves. ASCM 2012: 437-451 - Wen Zhang, Sanzheng Qiao, Yimin Wei:
The Diagonal Reduction Algorithm Using Fast Givens. ASCM 2012: 453-465 - Xiaoming Zhang, Baofeng Wu, Qingfang Jin, Zhuojun Liu:
Constructing Generalized Bent Functions from Trace Forms of Galois Rings. ASCM 2012: 467-477 - Zhi-Yong Zhang, Chun-Ming Yuan, Xiao-Shan Gao:
Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials. ASCM 2012: 479-503 - 2009
- Yoshinori Aono:
Simplification of the Lattice Based Attack of Boneh and Durfee for RSA Cryptoanalysis. ASCM 2009: 15-32 - François Boulier, Changbo Chen, François Lemaire, Marc Moreno Maza:
Real Root Isolation of Regular Chains. ASCM 2009: 33-48 - Howard Cheng, George Labahn:
A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices. ASCM 2009: 49-59 - Mark Giesbrecht, George Labahn, Yang Zhang:
Computing Popov Forms of Matrices Over PBW Extensions. ASCM 2009: 61-65 - Akinari Hoshi:
On the Simplest Quartic Fields and Related Thue Equations. ASCM 2009: 67-85 - Shutaro Inoue, Akira Nagai:
On the Implementation of Boolean Gröbner Bases. ASCM 2009: 87-92 - Heinz Kredel:
Comprehensive Gröbner Bases in a Java Computer Algebra System. ASCM 2009: 93-108 - Tateaki Sasaki:
A Practical Method for Floating-Point Gröbner Basis Computation. ASCM 2009: 109-124 - Tateaki Sasaki, Daiju Inaba:
Series-Expansion of Multivariate Algebraic Functions at Singular Points: Nonmonic Case. ASCM 2009: 125-140 - Hiroshi Sekigawa:
A Sequence of Nearest Polynomials with Given Factors. ASCM 2009: 141-145
skipping 3 more matches
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-06-06 01:09 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