- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
26 S.
- Sprache
-
Deutsch
- Anmerkungen
-
Literaturverz. S. 25 - 26
- Ereignis
-
Veröffentlichung
- (wo)
-
Saarbrücken
- (wer)
-
MPI Informatik
- (wann)
-
1996
- Urheber
-
Vorobyov, Sergei
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:43 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
- Vorobyov, Sergei
- MPI Informatik
Entstanden
- 1996
Ähnliche Objekte (12)
Krylov complexity in free and interacting scalar field theories with bounded power spectrum
Bounded degree spanning trees
Proof of the tree packing conjecture for bounded degree trees
The error-bounded descriptional complexity of approximation networks
The complexity of finite variable theories
The computational complexity of logical theories
On Communication, Bounded Complexity, and Cooperation
Complexity, bounded rationality and problem solving
Incentive Complexity, Bounded Rationality and Effort Provision
Incentive Complexity, Bounded Rationality and Effort Provision
Consistency of Circuit Lower Bounds with Bounded Theories
Complexity in tame quantum theories
Krylov complexity in free and interacting scalar field theories with bounded power spectrum
Bounded degree spanning trees
Proof of the tree packing conjecture for bounded degree trees
The error-bounded descriptional complexity of approximation networks
The complexity of finite variable theories
The computational complexity of logical theories
On Communication, Bounded Complexity, and Cooperation
Complexity, bounded rationality and problem solving
Incentive Complexity, Bounded Rationality and Effort Provision
Incentive Complexity, Bounded Rationality and Effort Provision
Consistency of Circuit Lower Bounds with Bounded Theories
Complexity in tame quantum theories
Krylov complexity in free and interacting scalar field theories with bounded power spectrum
Bounded degree spanning trees
Proof of the tree packing conjecture for bounded degree trees
The error-bounded descriptional complexity of approximation networks
The complexity of finite variable theories
The computational complexity of logical theories
On Communication, Bounded Complexity, and Cooperation
Complexity, bounded rationality and problem solving
Incentive Complexity, Bounded Rationality and Effort Provision
Incentive Complexity, Bounded Rationality and Effort Provision
Consistency of Circuit Lower Bounds with Bounded Theories