Остановите войну!
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 52 matches
- 2010
- Sergei A. Abramov:
On some decidable and undecidable problems related to q-difference equations with parameters. ISSAC 2010: 311-317 - Martin E. Avendano, Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek:
Randomized NP-completeness for p-adic rational roots of sparse polynomials in one variable. ISSAC 2010: 331-338 - Moulay A. Barkatou:
Symbolic methods for solving systems of linear ordinary differential equations. ISSAC 2010: 7-8 - Moulay A. Barkatou, Carole El Bacha, Eckhard Pflügel:
Simultaneously row- and column-reduced higher-order linear differential systems. ISSAC 2010: 45-52 - Christine Berkesch, Anton Leykin:
Algorithms for Bernstein-Sato polynomials and multiplier ideals. ISSAC 2010: 99-106 - Marco Bodrato:
A Strassen-like matrix multiplication suited for squaring and higher power computation. ISSAC 2010: 273-280 - Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li:
Complexity of creative telescoping for bivariate rational functions. ISSAC 2010: 203-210 - Nicolas Brisebarre, Mioara Joldes:
Chebyshev interpolation polynomial-based tools for rigorous computing. ISSAC 2010: 147-154 - Christopher W. Brown, Adam W. Strzebonski:
Black-box/white-box simplification and applications to quantifier elimination. ISSAC 2010: 69-76 - Yongjae Cha, Mark van Hoeij, Giles Levy:
Solving recurrence relations using local invariants. ISSAC 2010: 303-309 - Changbo Chen, James H. Davenport, John P. May, Marc Moreno Maza, Bican Xia, Rong Xiao:
Triangular decomposition of semi-algebraic systems. ISSAC 2010: 187-194 - Costanza Conti, Luca Gemignani, Lucia Romani:
Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes. ISSAC 2010: 251-256 - Wayne Eberly:
Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case. ISSAC 2010: 289-296 - Ioannis Z. Emiris, André Galligo, Elias P. Tsigaridas:
Random polynomials and expected complexity of bisection methods for real solving. ISSAC 2010: 235-242 - Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsigaridas:
The DMM bound: multivariate (aggregate) separation bounds. ISSAC 2010: 243-250 - Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. ISSAC 2010: 257-264 - Jean-Charles Faugère, Joachim von zur Gathen, Ludovic Perret:
Decomposition of generic multivariate polynomials. ISSAC 2010: 131-137 - Shuhong Gao, Yinhua Guan, Frank Volny:
A new incremental algorithm for computing Groebner bases. ISSAC 2010: 13-19 - Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler:
Composition collisions and projective polynomials: statement of results. ISSAC 2010: 123-130 - Vladimir P. Gerdt, Daniel Robertz:
Consistency of finite difference approximations for linear PDE systems and its algorithmic verification. ISSAC 2010: 53-59 - Jürgen Gerhard:
Asymptotically fast algorithms for modern computer algebra. ISSAC 2010: 9-10 - Dima Grigoriev, Fritz Schwarz:
Absolute factoring of non-holonomic ideals in the plane. ISSAC 2010: 93-97 - Feng Guo, Mohab Safey El Din, Lihong Zhi:
Global optimization of polynomials using generalized critical values and sums of squares. ISSAC 2010: 107-114 - David Harvey, Daniel S. Roche:
An in-place truncated fourier transform and applications to polynomial multiplication. ISSAC 2010: 325-329 - Mark van Hoeij, Giles Levy:
Liouvillian solutions of irreducible second order linear difference equations. ISSAC 2010: 297-301 - Mark van Hoeij, Quan Yuan:
Finding all bessel type solutions for linear differential equations with rational function coefficients. ISSAC 2010: 37-44 - Evelyne Hubert:
Algebraic invariants and their differential algebras. ISSAC 2010: 1-2 - Sharon Hutton, Erich L. Kaltofen, Lihong Zhi:
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. ISSAC 2010: 227-234 - Claude-Pierre Jeannerod, Christophe Mouilleron:
Computing specified generators of structured matrix inverses. ISSAC 2010: 281-288 - Deepak Kapur, Yao Sun, Dingkang Wang:
A new algorithm for computing comprehensive Gröbner systems. ISSAC 2010: 29-36
skipping 22 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-05-29 04:08 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