zweidimensionales bewegtes Bild
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
- Standort
-
Hannover TIB
- Umfang
-
42MB, 00:24:31:16 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Ganardi, Moses
Figelius, Michael
Lohrey, Markus
Zetzsche, Georg
- DOI
-
10.5446/49431
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Ganardi, Moses
- Figelius, Michael
- Lohrey, Markus
- Zetzsche, Georg
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
On the two-dimensional knapsack problem for convex polygons: Q/A Session C - Paper C3.C
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
The Complexity of Dynamic Data Race Prediction: Q/A Session E - Paper E6.E
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Panel Session Day Two: Q&A
Descriptive complexity of real computation and probabilistic independence logic: Q/A Session F - Paper F5.B
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
On the two-dimensional knapsack problem for convex polygons: Q/A Session C - Paper C3.C
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
The Complexity of Dynamic Data Race Prediction: Q/A Session E - Paper E6.E
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Panel Session Day Two: Q&A
Descriptive complexity of real computation and probabilistic independence logic: Q/A Session F - Paper F5.B
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
An Optimal Algorithm for Online Multiple Knapsack: Q/A Session A - Paper A2.B
On the two-dimensional knapsack problem for convex polygons: Q/A Session C - Paper C3.C
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
The Complexity of Dynamic Data Race Prediction: Q/A Session E - Paper E6.E
Descriptive complexity on non-Polish spaces II: Q/A Session C - Paper C4.F
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Panel Session Day Two: Q&A