zweidimensionales bewegtes Bild
Efficient Analysis of VASS Termination Complexity: Q/A Session A - Paper A5.C
- Location
-
Hannover TIB
- Extent
-
65MB, 00:24:32:08 (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
-
Kučera, Antonín
Leroux, Jérôme
Velan, Dominik
- DOI
-
10.5446/49274
- 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
- Kučera, Antonín
- Leroux, Jérôme
- Velan, Dominik
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
The Termination and Complexity Competition
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
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
Panel Session Day Two: Q&A
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
Descriptive complexity of real computation and probabilistic independence logic: Q/A Session F - Paper F5.B
The Termination and Complexity Competition
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
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
Panel Session Day Two: Q&A
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C
Descriptive complexity of real computation and probabilistic independence logic: Q/A Session F - Paper F5.B
The Termination and Complexity Competition
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
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
The complexity of knapsack problems in wreath products: Q/A Session E - Paper E4.B
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity: Q/A Session C - Paper C2.C
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
Panel Session Day Two: Q&A
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D
The complexity of promise SAT on non-Boolean domains: Q/A Session A - Paper A3.C