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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
A calculus for the random generation of labelled combinatorial structures
Philippe Flajolet
,
Paul Zimmerman
,
Bernard van Cutsem
Theoretical Computer Science
132
(1-2), 1994, pp. 1-35
Computational depth and reducibility
David W. Juedes
,
James I. Lathrop
,
Jack H. Lutz
Theoretical Computer Science
132
(1-2), 1994, pp. 37-70
Unrestricted complementation in language equations over a one-letter alphabet
E.L. Leiss
Theoretical Computer Science
132
(1-2), 1994, pp. 71-84
Retreat bounded picture languages
Changwook Kim
Theoretical Computer Science
132
(1-2), 1994, pp. 85-112
Computability with low-dimensional dynamical systems
Pascal Koiran
,
Michel Cosnard
,
Max Garzon
Theoretical Computer Science
132
(1-2), 1994, pp. 113-128
On language equations with invertible operations
Lila Kari
Theoretical Computer Science
132
(1-2), 1994, pp. 129-150
Primitive 2-structures with the
(n-2)
-property
Paola Bonizzoni
Theoretical Computer Science
132
(1-2), 1994, pp. 151-178
Asynchronous automata versus asynchronous cellular automata
Giovanni Pighizzini
Theoretical Computer Science
132
(1-2), 1994, pp. 179-207
A
k
-structure generalization of the theory of 2-structures
A. Ehrenfeucht
,
R. McConnell
Theoretical Computer Science
132
(1-2), 1994, pp. 209-227
Minimal pairs and complete problems
Klaus Ambos-Spies
,
Steven Homer
,
Robert I. Soare
Theoretical Computer Science
132
(1-2), 1994, pp. 229-241
Formal languages defined by uniform substitutions
Jean-Camille Birget
,
Joseph B. Stephen
Theoretical Computer Science
132
(1-2), 1994, pp. 243-258
One-way cellular automata on Cayley graphs
Zsuzsanna Róka
Theoretical Computer Science
132
(1-2), 1994, pp. 259-290
The knowledge complexity of quadratic residuosity languages
Alfredo de Santis
,
Giovanni di Crescenzo
,
Guiseppe Persiano
Theoretical Computer Science
132
(1-2), 1994, pp. 291-317
Deterministic versus nondeterministic space in terms of synchronized alternating machines
Juraj Hromkovic̑
,
Branislav Rovan
,
Anna Slobodova
Theoretical Computer Science
132
(1-2), 1994, pp. 319-336
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>