zweidimensionales bewegtes Bild
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
- Standort
-
Hannover TIB
- Umfang
-
55MB, 00:25:08:00 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 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
-
Tian, Cong
Wang, Wensheng
Duan, Zhenhua
- DOI
-
10.5446/49320
- Letzte Aktualisierung
-
17.03.2024, 12:59 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
- Tian, Cong
- Wang, Wensheng
- Duan, Zhenhua
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds: Q/A Session E - Paper E3.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
New Fault Tolerant Subset Preservers: Q/A Session E - Paper E1.F
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds: Q/A Session E - Paper E3.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
New Fault Tolerant Subset Preservers: Q/A Session E - Paper E1.F
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Knapsack Secretary with Bursty Adversary: Q/A Session D - Paper D1.C
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds: Q/A Session E - Paper E3.A
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
New Fault Tolerant Subset Preservers: Q/A Session E - Paper E1.F
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A