Остановите войну!
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 35 matches
- 2002
- Sergei A. Abramov:
Applicability of Zeilberger's algorithm to hypergeometric terms. ISSAC 2002: 1-7 - Bernhard Beckermann, Howard Cheng, George Labahn:
Fraction-free row reduction of matrices of skew polynomials. ISSAC 2002: 8-15 - Russell J. Bradford, James H. Davenport:
Towards better simplification of elementary functions. ISSAC 2002: 16-22 - Manuel Bronstein, Sébastien Lafaille:
Solutions of linear ordinary differential equations in terms of special functions. ISSAC 2002: 23-28 - Arthur D. Chtcherba, Deepak Kapur:
On the efficiency and optimality of Dixon-based resultant methods. ISSAC 2002: 29-36 - Robert M. Corless, André Galligo, Ilias S. Kotsireas, Stephen M. Watt:
A geometric-numeric algorithm for absolute factorization of multivariate polynomials. ISSAC 2002: 37-45 - Alicia Dickenstein, Ioannis Z. Emiris:
Multihomogeneous resultant matrices. ISSAC 2002: 46-54 - Samuel S. Dooley:
Editing mathematical content and presentation markup in interactive mathematical documents. ISSAC 2002: 55-62 - Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet:
Finite field linear algebra subroutines. ISSAC 2002: 63-74 - Pilar Fernandez-Ferreiros, Maria de los Angeles Gomez-Molleda, Laureano González-Vega:
Partial solvability by radicals. ISSAC 2002: 84-91 - Elisabetta Fortuna, Patrizia M. Gianni, Paola Parenti, Carlo Traverso:
Computing the topology of real algebraic surfaces. ISSAC 2002: 92-100 - Mark Giesbrecht, Erich L. Kaltofen, Wen-shin Lee:
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC 2002: 101-108 - Mark van Hoeij, Michael B. Monagan:
A modular GCD algorithm over number fields presented with multiple extensions. ISSAC 2002: 109-116 - Joris van der Hoeven:
A new zero-test for formal power series. ISSAC 2002: 117-122 - Shahadat Hossain, Trond Steihaug:
Sparsity issues in the computation of Jacobian matrices. ISSAC 2002: 123-130 - Claude-Pierre Jeannerod:
A reduced form for perturbed matrix polynomials. ISSAC 2002: 131-137 - Erich L. Kaltofen:
An output-sensitive variant of the baby steps/giant steps determinant algorithm. ISSAC 2002: 138-144 - Amit Khetan:
Determinantal formula for the chow form of a toric surface. ISSAC 2002: 145-150 - Irina A. Kogan, Marc Moreno Maza:
Computation of canonical forms for ternary cubics. ISSAC 2002: 151-160 - Ha Q. Le:
Simplification of definite sums of rational functions by creative symmetrizing method. ISSAC 2002: 161-167 - Ziming Li, Fritz Schwarz, Serguei P. Tsarev:
Factoring zero-dimensional ideals of linear partial differential operators. ISSAC 2002: 168-175 - Eugene M. Luks, Takunari Miyazaki:
Polynomial-time normalizers for permutation groups with restricted composition factors. ISSAC 2002: 176-183 - Guillermo Matera, Alexandre Sedoglavic:
The differential Hilbert function of a differential rational mapping can be computed in polynomial time. ISSAC 2002: 184-191 - Kosaku Nagasaka:
Towards certified irreducibility testing of bivariate approximate polynomials. ISSAC 2002: 192-199 - Masayuki Noro, Kazuhiro Yokoyama:
Yet another practical implementation of polynomial factorization over finite fields. ISSAC 2002: 200-206 - Victor Y. Pan, Xinmao Wang:
Acceleration of Euclidean algorithm and extensions. ISSAC 2002: 207-213 - Daniel Richardson, Simon Langley:
Some observations on familiar numbers. ISSAC 2002: 214-220 - Renaud Rioboo:
Towards faster real algebraic numbers. ISSAC 2002: 221-228 - Josef Schicho:
Simplification of surface parametrizations. ISSAC 2002: 229-237 - Éric Schost:
Degree bounds and lifting techniques for triangular sets. ISSAC 2002: 238-245
skipping 5 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-01 09:49 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