- Sprache
-
Englisch
- Umfang
-
1 Online-Ressource (S. [357] - 375)
- Anmerkungen
-
In: Computational Complexity, Vol. 6, No. 4, 1996/97. - Basel [u.a.] : Birkhäuser
- Standort
-
München, Bayerische Staatsbibliothek -- Z 92.62-6/7#S.357-375
- Beteiligte Personen und Organisationen
- Ereignis
-
Veröffentlichung
- (wo)
-
Basel [u.a.]
- (wer)
-
Birkhäuser
- (wann)
-
1996/97
- URN
-
urn:nbn:de:bvb:12-bsb00079506-0
- Letzte Aktualisierung
-
28.02.2025, 15:38 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Bayerische Staatsbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Bayerische Staatsbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Grigoriev, Dima
- Meyer auf der Heide, Friedhelm
- Birkhäuser
Entstanden
- 1996/97
Ähnliche Objekte (12)
General lower bounds for randomized direct search with isotropic sampling
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Upper and lower bounds for randomized search heuristics in black box optimization
Interleavings for categories with a flow and the hom-tree lower bound
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Semi-Algebraic Proofs, IPS Lower Bounds and the τ -Conjecture: Can a Natural Number be Negative?
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
General lower bounds for randomized direct search with isotropic sampling
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Upper and lower bounds for randomized search heuristics in black box optimization
Interleavings for categories with a flow and the hom-tree lower bound
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Semi-Algebraic Proofs, IPS Lower Bounds and the τ -Conjecture: Can a Natural Number be Negative?
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness
Inferring Lower Bounds for Runtime Complexity
General lower bounds for randomized direct search with isotropic sampling
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Upper and lower bounds for randomized search heuristics in black box optimization
Interleavings for categories with a flow and the hom-tree lower bound
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Semi-Algebraic Proofs, IPS Lower Bounds and the τ -Conjecture: Can a Natural Number be Negative?
Bisimulation on Speed: Lower Time Bounds
Lower bounds for Auslander's representation dimension
Guaranteed lower bounds to effective stiffness