zweidimensionales bewegtes Bild
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds: Q/A Session E - Paper E3.A
- Standort
-
Hannover TIB
- Umfang
-
48MB, 00:21:44:25 (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
-
Zehavi, Meirav
Fomin, Fedor
Lokshtanov, Daniel
Mihajlin, Ivan
Saurabh, Saket
- DOI
-
10.5446/49424
- 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
- Zehavi, Meirav
- Fomin, Fedor
- Lokshtanov, Daniel
- Mihajlin, Ivan
- Saurabh, Saket
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Tight bounds on the descriptional complexity of regular expressions
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
A tight lower bound for semi-synchronous collaborative grid exploration
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
A spectral bound on hypergraph discrepancy: Q/A Session B - Paper B3.E
Lower bounds for dynamic distributed task allocation: Q/A Session F - Paper F1.B
Lower Bounds for QBFs of Bounded Treewidth: Q/A Session D - Paper D5.B
Muscular contraction
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Qa- [Qa-]
Tight bounds on the descriptional complexity of regular expressions
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
A tight lower bound for semi-synchronous collaborative grid exploration
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
A spectral bound on hypergraph discrepancy: Q/A Session B - Paper B3.E
Lower bounds for dynamic distributed task allocation: Q/A Session F - Paper F1.B
Lower Bounds for QBFs of Bounded Treewidth: Q/A Session D - Paper D5.B
Muscular contraction
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Qa- [Qa-]
Tight bounds on the descriptional complexity of regular expressions
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
A tight lower bound for semi-synchronous collaborative grid exploration
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
A spectral bound on hypergraph discrepancy: Q/A Session B - Paper B3.E
Lower bounds for dynamic distributed task allocation: Q/A Session F - Paper F1.B
Lower Bounds for QBFs of Bounded Treewidth: Q/A Session D - Paper D5.B