Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Symbolic Computation AND YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm for computing invariants of linear actions of algebraic groups up to a given degree
Thomas Bayer
Journal Symbolic Computation
2003
, 2003, pp. 441-449
Model building with ordered resolution: Extracting models from saturated clause sets
Peter Baumgartner
,
Hantao Zhang
Journal Symbolic Computation
36
(1-2), 2003, pp. 5-48
A calculus combining resolution and enumeration for building finite models
Nicolas Peltier
Journal Symbolic Computation
36
(1-2), 2003, pp. 49-77
Stratified resolution
Anatoli Degtyarev
,
Robert Nieuwenhuis
,
Andrei Voronkov
Journal Symbolic Computation
36
(1-2), 2003, pp. 79-99
Limited resource strategy in resolution theorem proving
Alexandre Riazanov
,
Andrei Voronkov
Journal Symbolic Computation
36
(1-2), 2003, pp. 101-115
Depth-first proof search without backtracking for free-variable clausal tableaux
Bernhard Beckert
Journal Symbolic Computation
36
(1-2), 2003, pp. 117-138
leanCoP: Lean connection based theorem proving
Jens Otten
,
Wolfgang Bibel
Journal Symbolic Computation
36
(1-2), 2003, pp. 139-161
Hyperresolution for guarded formulae
Lilia Georgieva
,
Ullrich Hustadt
,
Renate A. Schmidt
Journal Symbolic Computation
36
(1-2), 2003, pp. 163-192
Constraint contextual rewriting
Alessandro Armando
,
Silvio Ranise
Journal Symbolic Computation
36
(1-2), 2003, pp. 193-216
On using ground joinable equations in equational theorem proving
J. Avenhus
,
Th. Hillenbrand
,
B. Löchner
Journal Symbolic Computation
36
(1-2), 2003, pp. 217-233
On the complexity of equational problems in CNF
Reinhard Pichler
Journal Symbolic Computation
36
(1-2), 2003, pp. 235-269
Computer proofs about finite and regular sets: The unifying concept of subvariance
Johan Gijsbertus Frederik Belinfante
Journal Symbolic Computation
36
(1-2), 2003, pp. 271-285
Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
Arthur D. Chtcherba
,
Deepak Kapur
Journal Symbolic Computation
36
(3-4), 2003, pp. 289-315
Multihomogeneous resultant formulae by means of complexes
Alicia Dickenstein
,
Ioannis Z. Emiris
Journal Symbolic Computation
36
(3-4), 2003, pp. 317-342
Algorithms to compute the topology of orientable real algebraic surfaces
E. Fortuna
,
P. Gianni
,
P. Parenti
,
C. Traverso
Journal Symbolic Computation
36
(3-4), 2003, pp. 343-364
Early termination in sparse interpolation algorithms
Erich Kaltofen
,
Wen-shin Lee
Journal Symbolic Computation
36
(3-4), 2003, pp. 365-400
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Mark Giesbrecht
,
Erich Kaltofen
,
Wen-shin Lee
Journal Symbolic Computation
36
(3-4), 2003, pp. 401-424
The resultant of an unmixed bivariate system
Amit Khetan
Journal Symbolic Computation
36
(3-4), 2003, pp. 425-442
Factoring systems of linear PDEs with finite-dimensional solution spaces
Ziming Li
,
Fritz Schwarz
,
Serguei P. Tsarev
Journal Symbolic Computation
36
(3-4), 2003, pp. 443-471
Fast computation of discrete invariants associated to a differential rational mapping
G. Matera
,
A. Sedoglavic
Journal Symbolic Computation
36
(3-4), 2003, pp. 473-499
Moving frames
Peter J. Olver
Journal Symbolic Computation
36
(3-4), 2003, pp. 501-512
Towards faster real algebraic numbers
Renaud Rioboo
Journal Symbolic Computation
36
(3-4), 2003, pp. 513-533
Simplification of surface parametrizations - A lattice polygon approach
Josef Schicho
Journal Symbolic Computation
36
(3-4), 2003, pp. 535-554
Complexity results for triangular sets
Éric Schost
Journal Symbolic Computation
36
(3-4), 2003, pp. 555-594
Computing in algebraic geometry and commutative algebra using Macaulay 2
Michael Stillman
Journal Symbolic Computation
36
(3-4), 2003, pp. 595-611
Seiten 1
2
3
>