zweidimensionales bewegtes Bild
Computational Complexity of the α-Ham-Sandwich Problem: Q/A Session C - Paper C3.E
- Location
-
Hannover TIB
- Extent
-
45MB, 00:21:01:01 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 2020 ; (Jan. 2020)
- Event
-
Veröffentlichung
- (who)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (when)
-
2020-01-01
- Contributor
-
Choudhary, Aruni
Chiu, Man-Kwun
Mulzer, Wolfgang
- DOI
-
10.5446/49386
- 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
- Choudhary, Aruni
- Chiu, Man-Kwun
- Mulzer, Wolfgang
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
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
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
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
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Ham sandwiches, staircases and counting polynomials
Ham sandwiches, staircases and counting polynomials
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
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
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
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
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Ham sandwiches, staircases and counting polynomials
Ham sandwiches, staircases and counting polynomials
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
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
On the Fine-Grained Complexity of Parity Problems: Q/A Session E - Paper E3.D
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
The Power of Many Samples in Query Complexity: Q/A Session D - Paper D2.C
Ham sandwiches, staircases and counting polynomials
Ham sandwiches, staircases and counting polynomials
Panel Session Day Two: Q&A
Quantum Distributed Complexity of Set Disjointness on a Line: Q/A Session D - Paper D3.D