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=Theor.~Comput.~Sci. AND Volume=157
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An introduction to pseudo-linear algebra
Manuel Bronstein
,
Marko Petkovs̆ek
Theoretical Computer Science
157
(1), 1996, pp. 3-33
An introduction to randomization in computational geometry
Olivier Devillers
Theoretical Computer Science
157
(1), 1996, pp. 35-52
Flexible high-order discretization of geometric data for global motion planning
Y. Elihai
,
Y. Yomdin
Theoretical Computer Science
157
(1), 1996, pp. 53-77
NC
solving of a system of linear ordinary differential equations in several unknowns
D. Grigoriev
Theoretical Computer Science
157
(1), 1996, pp. 79-90
Computability of the additive complexity of algebraic circuits with root extracting
Dima Grigoriev
,
Marek Karpinski
Theoretical Computer Science
157
(1), 1996, pp. 91-100
Nonholonomic systems: Controllability and complexity
Jean-Paul Laumond
,
Jean-Jacques Risler
Theoretical Computer Science
157
(1), 1996, pp. 101-114
Algorithms and methods in differential algebra
Jean Moulin Ollagnier
Theoretical Computer Science
157
(1), 1996, pp. 115-127
A bound for the degree of nonholonomy in the plane
Jean-Jacques Risler
Theoretical Computer Science
157
(1), 1996, pp. 129-136
Lower bounds for one-way probabilistic communication complexity and their application to space complexity
Farid Ablayev
Theoretical Computer Science
157
(2), 1996, pp. 139-159
On the complexity of partially observed Markov decision processes
Dima Burago
,
Michel de Rougemont
,
Anatol Slissenko
Theoretical Computer Science
157
(2), 1996, pp. 161-183
Complexity lower bounds for computation trees with elementary transcendental function gates
D. Grigoriev
,
N. Vorobjov
Theoretical Computer Science
157
(2), 1996, pp. 185-214
How to tidy up a symmetric set-system by use of uncrossing operations
Alexander V. Karzanov
Theoretical Computer Science
157
(2), 1996, pp. 215-225
A general method to construct oracles realizing given relationships between complexity classes
Andrei A. Muchnik
,
Nikolai K. Vereshchagin
Theoretical Computer Science
157
(2), 1996, pp. 227-258
On some approximation problems concerning sparse polynomials over finite fields
Marek Karpinski
,
Igor Shparlinski
Theoretical Computer Science
157
(2), 1996, pp. 259-266
Computational complexity of functions
Leonid A. Levin
Theoretical Computer Science
157
(2), 1996, pp. 267-271
On finding primitive roots in finite fields
Igor Shparlinski
Theoretical Computer Science
157
(2), 1996, pp. 273-275
Towards the parallel repetition conjecture
Oleg Verbitsky
Theoretical Computer Science
157
(2), 1996, pp. 277-282