Thomas Lickteig

Generating author description...

All published works

Action	Title	Year	Authors
+	Festschrift in honor of Arnold Schönhage	2005	Thomas Lickteig
+	Sylvester–Habicht Sequences and Fast Cauchy Index Computation	2001	Thomas Lickteig Marie-Françoise Roy
+	Semi-algebraic Complexity of Quotients and Sign Determination of Remainders	1996	Thomas Lickteig Marie-Françoise Roy
+	Cauchy index computation	1996	Thomas Lickteig Marie-Françoise Roy
+	Semi-algebraic decision complexity, the real spectrum, and degree	1996	Thomas Lickteig
+ PDF Chat	How can a complex square root be computed in an optimal way?	1996	Thomas Lickteig Kai Werther
+	How can a complex square root be computed in an optimal way?	1995	Thomas Lickteig Kai Werther
+	Verification complexity of linear prime ideals	1992	Peter Bürgisser Thomas Lickteig
+	Test complexity of generic polynomials	1992	Peter Bürgisser Thomas Lickteig Michael Shub
+	On randomized algebraic test complexity	1992	Peter B urgisser Marek Karpiński Thomas Lickteig
+	On the order of approximation in approximative triadic decompositions of tensors	1989	Thomas Lehmkuhl Thomas Lickteig
+	A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras	1989	Thomas Lickteig
+	The Computational Complexity of Division in Quadratic Extension Fields	1987	Thomas Lickteig
+	Typical tensorial rank	1985	Thomas Lickteig
+	A note on border rank	1984	Thomas Lickteig

Common Coauthors

Coauthor	Papers Together
Marie-Françoise Roy	3
Kai Werther	2
Peter Bürgisser	2
Peter B urgisser	1
Thomas Lehmkuhl	1
Marek Karpiński	1
Michael Shub	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Schnelle Berechnung von Kettenbruchentwicklungen	1971	Arnold Schönhage	4
+	Géométrie algébrique réelle	1987	Jacek Bochnak Michel Coste M-F Roy	4
+	O(n2.7799) complexity for n × n approximate matrix multiplication	1979	Dario A. Bini Milvio Capovani Francesco Romani G. Lotti	3
+ PDF Chat	Lectures on Formally Real Fields	1984	Alexander Prestel	3
+	An Extension of Strassen’s Degree Bound	1981	C. P. Schnorr	3
+	Semi-algebraic decision complexity, the real spectrum, and degree	1996	Thomas Lickteig	3
+	The non-scalar Model of Complexity in Computational Geometry	1991	José Luis Montaña Luis Miguel Pardo Tomás Recio	3
+	The complexity of partial derivatives	1983	Walter Bäur Volker Strassen	3
+	The Computational Complexity of Division in Quadratic Extension Fields	1987	Thomas Lickteig	3
+	Commutative Ring Theory	1987	H. Matsumura	2
+	Test complexity of generic polynomials	1992	Peter Bürgisser Thomas Lickteig Michael Shub	2
+	Rabin's width of a complete proof and the width of a semialgebraic set	1989	Tomás Recio Luis Miguel Pardo	2
+	On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2 × 2-matrix multiplication	1978	Hans F. de Groote	2
+	An algorithm for division of powerseries	1972	Malte Sieveking	2
+	Graduate Texts in Mathematics	2020	J. H. van Lint	2
+	On varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mapping	1978	Hans F. de Groote	2
+	Generalized Polynomial Remainder Sequences	1982	Rüdiger Loos	2
+ PDF Chat	Spécialisation de la suite de Sturm et sous-résultants (I)	1990	Laureano González-Vega Henri Lombardi Tomás Recio Marie-Françoise Roy	2
+ PDF Chat	Basic Algebraic Geometry	1974	Igor R. Shafarevich	2
+	An elementary proof for strassen's degree bound	1976	Arnold Schönhage	2
+	Basic Algebraic Geometry 2	1994	Igor R. Shafarevich	2
+	Lehrbuch der Algebra	1988	Günter Scheja Uwe Storch	2
+ PDF Chat	Algorithme de Bareiss, algorithme des sous-résultants	1996	Lionel Ducos	2
+	On multiplication of 2 × 2 matrices	1971	S. Winograd	2
+	On the algorithmic complexity of associative algebras	1981	Alfredo C. Alder Volker Strassen	2
+	Spécialisation de la suite de Sturm et sous-résultants	1989	Laureano Gonzalez Henri Lombardi Tomás Recio Marie-Françoise Roy	2
+ PDF Chat	On the real spectrum of a ring and its application to semialgebraic geometry	1986	Eberhard Becker	2
+	A lower bound for the length of addition chains	1975	Arnold Schönhage	1
+ PDF Chat	XVIII. On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm’s functions, and that of the greatest algebraical common measure	1853	J.J. Sylvester	1
+	The basic theory of real closed spaces	1989	Niels Schwartz	1
+	Multiplicative complexity of Taylor shifts and a new twist of the substitution method	2002	Arnold Schönhage	1
+	�ber das Wachstum zusammengesetzter Funktionen	1960	Arnold Sch�nhage	1
+ PDF Chat	On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors	1971	Warren S. Brown	1
+	Optimal Evaluation of Pairs of Bilinear Forms	1979	Joseph F. JáJá	1
+	Quantifier Elimination and Cylindrical Algebraic Decomposition	1998	B. F. Caviness Jeremy Johnson	1
+	Rings that are nearly associative	2021	K. A. Zhevlakov A. M Slin I. P. Shestakov	1
+	Faisceau structural sur le spectre réel et fonctions de Nash	1982	Marie-Françoise Roy	1
+	Lower bounds for the approximative complexity	1986	Bernhard Griesser	1
+ PDF Chat	Witt rings and K-theory	1984	G. W. Brumfiel	1
+	Relative bilinear complexity and matrix multiplication.	1987	Volker Strassen	1
+ PDF Chat	Linear decision trees, subspace arrangements and Möbius functions	1994	Anders Björner László Lovász	1
+	On commutativity and approximation	1983	Dario Bini	1
+	Proving simultaneous positivity of linear forms	1972	Michael O. Rabin	1
+	Linear decision trees	1992	Anders Björner László Lovász Andrew Chi-Chih Yao	1
+ PDF Chat	Geometric convergence toe ?z by rational functions with real poles	1976	Edward B. Saff Arnold Schönhage R. S. Varga	1
+	Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication	1982	Francesco Romani	1
+	Verification complexity of linear prime ideals	1992	Peter Bürgisser Thomas Lickteig	1
+	On multiplication in algebraic extension fields	1979	S. Winograd	1
+	Lower bounds of the complexity of linear algebras	1979	Dario A. Bini Milvio Capovani	1
+	Quasi-GCD computations	1985	Arnold Schönhage	1