Остановите войну!
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 39 matches
- 2005
- John Abbott, Martin Kreuzer, Lorenzo Robbiano:
Computing zero-dimensional schemes. J. Symb. Comput. 39(1): 31-49 (2005) - William A. Adkins, J. William Hoffman, Hao Hao Wang:
Equations of parametric surfaces with base points via syzygies. J. Symb. Comput. 39(1): 73-101 (2005) - Juan Gerardo Alcázar, J. Rafael Sendra:
Computation of the topology of real algebraic space curves. J. Symb. Comput. 39(6): 719-744 (2005) - Alessandro Armando, Clemens Ballarin:
A reconstruction and extension of Maple's assume facility via constraint contextual rewriting. J. Symb. Comput. 39(5): 503-521 (2005) - Ruth L. Auerbach:
The Gröbner fan and Gröbner walk for modules. J. Symb. Comput. 39(2): 127-153 (2005) - Michael Beeson, Freek Wiedijk:
The meaning of infinity in calculus and computer algebra systems. J. Symb. Comput. 39(5): 523-538 (2005) - Maria Paola Bonacina:
Towards a unified model of search in theorem-proving: subgoal-reduction strategies. J. Symb. Comput. 39(2): 209-255 (2005) - Hans-Christian Graf von Bothmer, Cord Erdenberger, Katharina Ludwig:
A new family of rational surfaces in P4. J. Symb. Comput. 39(1): 51-60 (2005) - Laurent Busé, André Galligo:
Semi-implicit representations of surfaces in , resultants and applications. J. Symb. Comput. 39(3-4): 317-329 (2005) - Olga Caprotti, Volker Sorge:
Integration of automated reasoning and computer algebra systems. J. Symb. Comput. 39(5): 501-502 (2005) - Falai Chen, David A. Cox, Yang Liu:
The mu-basis and implicitization of a rational parametric surface. J. Symb. Comput. 39(6): 689-706 (2005) - William Y. C. Chen, Qing-Hu Hou, Yan-Ping Mu:
Applicability of the q-analogue of Zeilberger's algorithm. J. Symb. Comput. 39(2): 155-170 (2005) - Arjeh M. Cohen, Gert-Martin Greuel, Marie-Françoise Roy:
Preface. J. Symb. Comput. 39(3-4): 257-258 (2005) - Simon Colton:
Automated conjecture making in number theory using HR, Otter and Maple. J. Symb. Comput. 39(5): 593-615 (2005) - Carlos D'Andrea, Gabriela Jeronimo:
Subresultants and generic monomial bases. J. Symb. Comput. 39(3-4): 259-277 (2005) - Vahid Dabbaghian-Abdoly:
An algorithm for constructing representations of finite groups. J. Symb. Comput. 39(6): 671-688 (2005) - Ivan Damgård, Gudmund Skovbjerg Frandsen:
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers. J. Symb. Comput. 39(6): 643-652 (2005) - David Delahaye, Micaela Mayero:
Dealing with algebraic expressions over a field in Coq using Maple. J. Symb. Comput. 39(5): 569-592 (2005) - Harm Derksen, Emmanuel Jeandel, Pascal Koiran:
Quantum automata and algebraic groups. J. Symb. Comput. 39(3-4): 357-371 (2005) - Jan Draisma:
Representation theory on the open Bruhat cell. J. Symb. Comput. 39(3-4): 279-303 (2005) - Elisabetta Fortuna, Patrizia M. Gianni, Barry M. Trager:
Irreducible decomposition of polynomial ideals. J. Symb. Comput. 39(3-4): 305-316 (2005) - Luis David García-Puente, Michael Eugene Stillman, Bernd Sturmfels:
Algebraic geometry of Bayesian networks. J. Symb. Comput. 39(3-4): 331-355 (2005) - Hanne Gottliebsen, Tom Kelsey, Ursula Martin:
Hidden verification for computational mathematics. J. Symb. Comput. 39(5): 539-567 (2005) - Michel Granger, Toshinori Oaku, Nobuki Takayama:
Tangent cone algorithm for homogenized differential operators. J. Symb. Comput. 39(3-4): 417-431 (2005) - David Helm, Ezra Miller:
Algorithms for graded injective resolutions and local cohomology over semigroup rings. J. Symb. Comput. 39(3-4): 373-395 (2005) - Christopher J. Hillar:
Cyclic resultants. J. Symb. Comput. 39(6): 653-669 (2005) - Joris van der Hoeven:
Effective analytic functions. J. Symb. Comput. 39(3-4): 433-449 (2005) - Alexander Hulpke:
Constructing transitive permutation groups. J. Symb. Comput. 39(1): 1-30 (2005) - M'hammed El Kahoui:
Birational properties of the gap subresultant varieties. J. Symb. Comput. 39(1): 61-71 (2005) - Henri Lombardi, Ihsen Yengui:
Suslin's algorithms for reduction of unimodular rows. J. Symb. Comput. 39(6): 707-717 (2005)
skipping 9 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-31 17:57 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