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=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing with toric varieties
Helena Verrill
,
David Joyner
Journal Symbolic Computation
42
(5), 2007, pp. 511-532
A new class of term orders for elimination
Quoc-Nam Tran
Journal Symbolic Computation
42
(5), 2007, pp. 533-548
G
-graphs: A new representation of groups
Alain Bretto
,
Alain Faisant
,
Luc Gillibert
Journal Symbolic Computation
42
(5), 2007, pp. 549-560
Gröbner bases with respect to several orderings and multivariable dimension polynomials
Alexander B. Levin
Journal Symbolic Computation
42
(5), 2007, pp. 561-578
Trivializing a central simple algebra of degree 4 over the rational numbers
Jana Pílniková
Journal Symbolic Computation
42
(6), 2007, pp. 579-586
MOPS: Multivariate orthogonal polynomials (symbolically)
Ioana Dumitriu
,
Alan Edelman
,
Gene Shuman
Journal Symbolic Computation
42
(6), 2007, pp. 587-620
New effective bounds on the dimension of a linear system in
P^2
Marcin Dumnicki
,
Witold Jarnicki
Journal Symbolic Computation
42
(6), 2007, pp. 621-635
Solving parametric polynomial systems
Daniel Lazard
,
Fabrice Rouillier
Journal Symbolic Computation
42
(6), 2007, pp. 636-667
Generation of groups of square-free order
Michael C. Slattery
Journal Symbolic Computation
42
(6), 2007, pp. 668-677
A delineability-based method for computing critical sets of algebraic surfaces
Juan Gerardo Alcazar
,
Josef Schicho
,
Juan Rafael Sendra
Journal Symbolic Computation
42
(6), 2007, pp. 678-691
On approximate triangular decompositions in dimension zero
Marc Moreno Maza
,
Greg Reid
,
Robin Scott
,
Wenyuan Wu
Journal Symbolic Computation
42
(7), 2007, pp. 693-716
Are Buchberger's criteria necessary for the chain condition?
Hoon Hong
,
John Perry
Journal Symbolic Computation
42
(7), 2007, pp. 717-732
Output-sensitive modular algorithms for polynomial matrix normal forms
Howard Cheng
,
George Labahn
Journal Symbolic Computation
42
(7), 2007, pp. 733-750
Recognizing and parametrizing curves isomorphic to a line
Chi-Ming Lam
,
Vladimir Shpilrain
,
Jie-Tai Yu
Journal Symbolic Computation
42
(7), 2007, pp. 751-756
Structure theorems for parallel integration
Manuel Bronstein
Journal Symbolic Computation
42
(7), 2007, pp. 757-769
Generalized power series solutions to linear partial differential equations
Joris van der Hoeven
Journal Symbolic Computation
42
(8), 2007, pp. 771-791
New algorithms for relaxed multiplication
Joris van der Hoeven
Journal Symbolic Computation
42
(8), 2007, pp. 792-802
Gröbner bases for families of affine or projective schemes
Michael Wibmer
Journal Symbolic Computation
42
(8), 2007, pp. 803-834
Computation of the singularities of parametric plane curves
Sonia Pérez-Díaz
Journal Symbolic Computation
42
(8), 2007, pp. 835-857
A Gröbner-based treatment of elimination theory for affine varieties
Peter Schauenburg
Journal Symbolic Computation
42
(9), 2007, pp. 859-870
The Moufang loops of order 64 and 81
Gábor P. Nagy
,
Petr Vojtȇchovský
Journal Symbolic Computation
42
(9), 2007, pp. 871-883
Symmetric subresultants and applications
Philippe Saux Picart
,
Cyril Brunie
Journal Symbolic Computation
42
(9), 2007, pp. 884-919
Linear syntax for communicating elementary mathematics
C.J. Sangwin
,
P. Ramsden
Journal Symbolic Computation
42
(9), 2007, pp. 920-934
On complete system of invariants for the binary form of degree 7
Leonid Bedratyuk
Journal Symbolic Computation
42
(10), 2007, pp. 935-947
Summation algorithms for Stirling number identities
Manuel Kauers
Journal Symbolic Computation
42
(10), 2007, pp. 948-970
Seiten
<
1
2
3
>