- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
35 Bl.
- Sprache
-
Deutsch
- Erschienen in
-
Forschungsberichte des Fachbereiches Informatik / Technische Universität Berlin ; Bericht 1993,46
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Leiter der Fachbibliothek Informatik, Sekretariat FR 5-4
- (wann)
-
1993
- Urheber
-
Lindner, Wolfgang
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:15 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Lindner, Wolfgang
- Leiter der Fachbibliothek Informatik, Sekretariat FR 5-4
Entstanden
- 1993
Ähnliche Objekte (12)
On the structure of the polynomial time degrees of recursive sets
On the structure of the polynomial time degrees of recursive sets
Distinguishing numbers of infinite graphs with bounded degrees
Resource bounded measure and learnability
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On pseudorandomness and resource-bounded measure
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
A coverage measure for bounded model checking
Polynomial time calculi
A new discretization for mth-Laplace equations with arbitrary polynomial degrees
On average polynomial time
A new generalization of the P1 non-conforming FEM to higher polynomial degrees
On the structure of the polynomial time degrees of recursive sets
On the structure of the polynomial time degrees of recursive sets
Distinguishing numbers of infinite graphs with bounded degrees
Resource bounded measure and learnability
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On pseudorandomness and resource-bounded measure
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
A coverage measure for bounded model checking
Polynomial time calculi
A new discretization for mth-Laplace equations with arbitrary polynomial degrees
On average polynomial time
A new generalization of the P1 non-conforming FEM to higher polynomial degrees
On the structure of the polynomial time degrees of recursive sets
On the structure of the polynomial time degrees of recursive sets
Distinguishing numbers of infinite graphs with bounded degrees
Resource bounded measure and learnability
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
On pseudorandomness and resource-bounded measure
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
A coverage measure for bounded model checking
Polynomial time calculi
A new discretization for mth-Laplace equations with arbitrary polynomial degrees
On average polynomial time