- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Rectangle Covers Revisited Computationally ; 2004, 37
Preprint Reihe Mathematik ; 2004, 37
- Klassifikation
-
Mathematik
- Urheber
-
Heinrich-Litan, Laura
Lübbecke, Marco E.
- DOI
-
10.14279/depositonce-14292
- Handle
-
11303/15519
- URN
-
urn:nbn:de:101:1-2022011306452747428710
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 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
- Heinrich-Litan, Laura
- Lübbecke, Marco E.
Ähnliche Objekte (12)
Computationally secure information flow
Computationally secure information flow
Computationally efficient flux variability analysis
Computationally tractable classes of ordered sets
Computationally intensive Value at Risk calculations
Computationally Supported Inversion of Ketoreductase Stereoselectivity
Minimizing finite automata is computationally hard
Moral responsibility for computationally designed products
Exploiting structure in computationally hard voting problems
Computationally efficient design of directionally compliant metamaterials
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS
Functional verification of computationally predicted qnr genes
Computationally secure information flow
Computationally secure information flow
Computationally efficient flux variability analysis
Computationally tractable classes of ordered sets
Computationally intensive Value at Risk calculations
Computationally Supported Inversion of Ketoreductase Stereoselectivity
Minimizing finite automata is computationally hard
Moral responsibility for computationally designed products
Exploiting structure in computationally hard voting problems
Computationally efficient design of directionally compliant metamaterials
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS
Functional verification of computationally predicted qnr genes
Computationally secure information flow
Computationally secure information flow
Computationally efficient flux variability analysis
Computationally tractable classes of ordered sets
Computationally intensive Value at Risk calculations
Computationally Supported Inversion of Ketoreductase Stereoselectivity
Minimizing finite automata is computationally hard
Moral responsibility for computationally designed products
Exploiting structure in computationally hard voting problems
Computationally efficient design of directionally compliant metamaterials
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS