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
[1]
Hilfe
Suche: Journal=J. Symbolic Computation AND Volume=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing restrictions of ideals in finitely generated
k
-algebras by means of Buchberger's algorithm
Thomas Beth
,
Jörn Müller-Quade
,
Rainer Steinwandt
Journal Symbolic Computation
41
(3-4), 2006, pp. 372-380
Towards a clausal analysis of cut-elimination
Matthias Baaz
,
Alexander Leitsch
Journal Symbolic Computation
41
(3-4), 2006, pp. 381-410
Logicographic symbols
Koji Nakagawa
Journal Symbolic Computation
41
(3-4), 2006, pp. 411-434
An automated prover for Zermelo-Fraenkel set theory in Theorema
Wolfgang Windsteiger
Journal Symbolic Computation
41
(3-4), 2006, pp. 435-470
Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
Bruno Buchberger
Journal Symbolic Computation
41
(3-4), 2006, pp. 475-511
Fraction-free row reduction of matrices of Ore polynomials
Bernhard Beckermann
,
Howard Cheng
,
George Labahn
Journal Symbolic Computation
41
(5), 2006, pp. 513-543
Brauer groups of diagonal quartic surfaces
Martin Bright
Journal Symbolic Computation
41
(5), 2006, pp. 544-558
Finitely labeled generating trees and restricted permutations
Vincent Vatter
Journal Symbolic Computation
41
(5), 2006, pp. 559-572
String rewriting for double coset systems
Ronald Brown
,
Neil Ghani
,
Anne Heyworth
,
Christopher D. Wensley
Journal Symbolic Computation
41
(5), 2006, pp. 573-590
Resultants of partially composed polynomials
Manfred Minimair
Journal Symbolic Computation
41
(5), 2006, pp. 591-602
Algebraic solutions of holomorphic foliations: An algorithmic approach
S.C. Coutinho
,
L. Menasché Schechter
Journal Symbolic Computation
41
(5), 2006, pp. 603-618
Erratum to ''Ideals, bifiltered modules and bivariate Hilbert polynomials''
Giuseppa Carrá Ferro
Journal Symbolic Computation
41
(5), 2006, pp. 619-619
An algorithm to solve integer linear systems exactly using numerical methods
Zhendong Wan
Journal Symbolic Computation
41
(6), 2006, pp. 621-632
Normal forms in a cyclically graded Lie algebra
Martin Bendersky
,
Richard C. Churchill
Journal Symbolic Computation
41
(6), 2006, pp. 633-662
The lex game and some applications
Bálint Felszeghy
,
Balázs Ráth
,
Lajos Rónyai
Journal Symbolic Computation
41
(6), 2006, pp. 663-681
From an approximate to an exact absolute polynomial factorization
Guillaume Chèze
,
André Galligo
Journal Symbolic Computation
41
(6), 2006, pp. 682-696
Validated numerical computation of the
L_\infty
-norm for linear dynamical systems
Masaaki Kanno
,
Malcolm C. Smith
Journal Symbolic Computation
41
(6), 2006, pp. 697-707
Normal forms for general polynomial matrices
Bernhard Beckermann
,
George Labahn
,
Gilles Villard
Journal Symbolic Computation
41
(6), 2006, pp. 708-737
A polynomial time algorithm for finding rational general solutions of first order autonomous ODEs
Ruyong Feng
,
Xiao-Shan Gao
Journal Symbolic Computation
41
(7), 2006, pp. 739-762
Decision algorithms for fragments of real analysis. I. Continuous functions with strict convexity and concavity predicates
Domenico Cantone
,
Gianluca Cincotti
,
Giovanni Gallo
Journal Symbolic Computation
41
(7), 2006, pp. 763-789
Parameterized norm form equations with arithmetic progressions
A. Bérczes
,
A. Pethŏ
,
V. Ziegler
Journal Symbolic Computation
41
(7), 2006, pp. 790-810
Symbolic computation with finite quandles
Richard Henderson
,
Todd Macedo
,
Sam Nelson
Journal Symbolic Computation
41
(7), 2006, pp. 811-817
A hybrid search algorithm for the whitehead minimization problem
A.D. Myasnikov
,
R.M. Haralick
Journal Symbolic Computation
41
(7), 2006, pp. 818-834
Gröbner bases of ideals invariant under endomorphisms
Vesselin Drensky
,
Roberto la Scala
Journal Symbolic Computation
41
(7), 2006, pp. 835-846
Computing the character table of a finite group
W.R. Unger
Journal Symbolic Computation
41
(8), 2006, pp. 847-862
Seiten
<
1
2
3
4
>