zweidimensionales bewegtes Bild
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
- Location
-
Hannover TIB
- Extent
-
55MB, 00:25:08:00 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2020 ; (Jan. 2020)
- Event
-
Veröffentlichung
- (who)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (when)
-
2020-01-01
- Contributor
-
Tian, Cong
Wang, Wensheng
Duan, Zhenhua
- DOI
-
10.5446/49320
- Last update
-
04.12.2024, 8:09 AM CET
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- Tian, Cong
- Wang, Wensheng
- Duan, Zhenhua
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (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