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=133
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Separation of complexity classes in Koiran's weak model
F. Cucker
,
M. Shub
,
S. Smale
Theoretical Computer Science
133
(1), 1994, pp. 3-14
Relativizations of the
P=? NP
question over the reals (and other ordered rings)
T. Emerson
Theoretical Computer Science
133
(1), 1994, pp. 15-22
Deviation theorems for solutions of differential equations and applications to lower bounds on parallel complexity of sigmoids
D.Yu. Grigoriev
Theoretical Computer Science
133
(1), 1994, pp. 23-33
Computing over the reals with addition and order
P. Koiran
Theoretical Computer Science
133
(1), 1994, pp. 35-47
Regular unimodal systems and factors of finite automata
Petr Kůrka
Theoretical Computer Science
133
(1), 1994, pp. 49-64
On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
Gregorio Malajovich
Theoretical Computer Science
133
(1), 1994, pp. 65-84
On the complexity of quadratic programming in real number models of computation
K. Meer
Theoretical Computer Science
133
(1), 1994, pp. 85-94
P \neq NP
over the nonstandard reals implies
P \neq NP
over
R
Christian Michaux
Theoretical Computer Science
133
(1), 1994, pp. 95-104
A convex geometric approach to counting the roots of a polynomial system
J. Maurice Rojas
Theoretical Computer Science
133
(1), 1994, pp. 105-140
Complexity of Bezout's theorem V: Polynomial time
M. Shub
,
S. Smale
Theoretical Computer Science
133
(1), 1994, pp. 141-164
Homotopies for solving polynomial systems within a bounded domain
Jan Verschelde
,
Ann Haegemans
Theoretical Computer Science
133
(1), 1994, pp. 165-185
An overview of transaction logic
Anthony J. Bonner
,
Michael Kifer
Theoretical Computer Science
133
(2), 1994, pp. 205-265
Intuitionistic interpretation of deductive databases with incomplete information
Fangqing Dong
,
Laks V.S. Lakshmanan
Theoretical Computer Science
133
(2), 1994, pp. 267-306
An overview of the Tecton proof system
D. Kapur
,
X. Nie
,
D.R. Musser
Theoretical Computer Science
133
(2), 1994, pp. 307-339
Refinement of events in the development of real-time distributed systems
Geetha Ramanathan
Theoretical Computer Science
133
(2), 1994, pp. 341-359
Towards efficient induction mechanisms in database systems
Jiawei Han
Theoretical Computer Science
133
(2), 1994, pp. 361-385
An incremental concept formation approach for learning from databases
Robert Godin
,
Rokia Missaoui
Theoretical Computer Science
133
(2), 1994, pp. 387-419
Aggregate operations in the information source tracking method
Fereidoon Sadri
Theoretical Computer Science
133
(2), 1994, pp. 421-442