Thomas Lickteig

According to our database, Thomas Lickteig authored at least 19 papers between 1984 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2005

Festschrift in honor of Arnold Scho"nhage.

Thomas Lickteig

J. Complex., 2005

2004

04061 Abstracts Collection - Real Computation and Complexity.

Thomas Lickteig, Klaus Meer, Luis Miguel Pardo

Proceedings of the Real Computation and Complexity, 1.-6. February 2004, 2004

04061 Summary - Real Computation and Complexity.

Thomas Lickteig, Klaus Meer, Luis Miguel Pardo

Proceedings of the Real Computation and Complexity, 1.-6. February 2004, 2004

2001

Sylvester-Habicht Sequences and Fast Cauchy Index Computation.

Thomas Lickteig, Marie-Françoise Roy

J. Symb. Comput., 2001

2000

Preface.

Felipe Cucker, Thomas Lickteig

J. Complex., 2000

1997

Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks.

Thomas Lickteig, Klaus Meer

J. Complex., 1997

1996

Semi-algebraic Complexity of Quotients and Sign Determination of Remainders.

Thomas Lickteig, Marie-Françoise Roy

J. Complex., 1996

1995

A Note on Testing the Resultant.

Thomas Lickteig, Klaus Meer

J. Complex., 1995

How can a Complex Square Root be Computed in an Optimal Way.

Thomas Lickteig, Kai Werther

Comput. Complex., 1995

On real Turing machines that toss coins.

Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1993

On Randomized Semi-algebraic Test Complexity.

Peter Bürgisser, Marek Karpinski, Thomas Lickteig

J. Complex., 1993

1992

Test complexity of generic polynomials.

Peter Bürgisser, Thomas Lickteig, Michael Shub

J. Complex., 1992

1991

Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.

Peter Bürgisser, Marek Karpinski, Thomas Lickteig

Comput. Complex., 1991

1989

On the Order of Approximation in Approximative Triadic Decompositions of Tensors.

Thomas Lehmkuhl, Thomas Lickteig

Theor. Comput. Sci., 1989

A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras.

Thomas Lickteig

SIAM J. Comput., 1989

1987

The Computational Complexity of Division in Quadratic Extension Fields.

Thomas Lickteig

SIAM J. Comput., 1987

Some Results on the Complexity of Powers.

Thomas Lickteig, Hugo Volger

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two.

Thomas Lickteig

Inf. Process. Lett., 1986

1984

A Note on Border Rank.

Thomas Lickteig

Inf. Process. Lett., 1984