zweidimensionales bewegtes Bild
The Complexity of Bounded Context Switching with Dynamic Thread Creation: Q/A Session D - Paper D4.B
- Location
-
Hannover TIB
- Extent
-
41MB, 00:24:25:17 (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
-
Baumann, Pascal
Majumdar, Rupak
Srinivasan, Ramanathan Thinniyam
Zetzsche, Georg
- DOI
-
10.5446/49411
- 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
- Baumann, Pascal
- Majumdar, Rupak
- Srinivasan, Ramanathan Thinniyam
- Zetzsche, Georg
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
Complexity, bounded rationality and problem solving
On Communication, Bounded Complexity, and Cooperation
Incentive Complexity, Bounded Rationality and Effort Provision
Incentive Complexity, Bounded Rationality and Effort Provision
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Lower-Bounded Clustering - Models, Complexity and (Parameterised) Approximation
Bounded Rationality and Strategic Complexity in Repeated Games
The error-bounded descriptional complexity of approximation networks
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Complexity of Normal Forms on Structures of Bounded Degree
Lower Bounds for QBFs of Bounded Treewidth: Q/A Session D - Paper D5.B
Complexity, bounded rationality and problem solving
On Communication, Bounded Complexity, and Cooperation
Incentive Complexity, Bounded Rationality and Effort Provision
Incentive Complexity, Bounded Rationality and Effort Provision
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Lower-Bounded Clustering - Models, Complexity and (Parameterised) Approximation
Bounded Rationality and Strategic Complexity in Repeated Games
The error-bounded descriptional complexity of approximation networks
Qa- [Qa-]
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Complexity of Normal Forms on Structures of Bounded Degree
Lower Bounds for QBFs of Bounded Treewidth: Q/A Session D - Paper D5.B
Complexity, bounded rationality and problem solving
On Communication, Bounded Complexity, and Cooperation
Incentive Complexity, Bounded Rationality and Effort Provision
Incentive Complexity, Bounded Rationality and Effort Provision
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Lower-Bounded Clustering - Models, Complexity and (Parameterised) Approximation
Bounded Rationality and Strategic Complexity in Repeated Games
The error-bounded descriptional complexity of approximation networks
Qa- [Qa-]
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Complexity of Normal Forms on Structures of Bounded Degree