zweidimensionales bewegtes Bild
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
- Location
-
Hannover TIB
- Extent
-
37MB, 00:20:27:21 (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
-
Deligkas, Argyrios
Fearnley, John
Savani, Rahul
- DOI
-
10.5446/49394
- 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
- Deligkas, Argyrios
- Fearnley, John
- Savani, Rahul
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
One-Clock Priced Timed Games are PSPACE-hard: Q/A Session C - Paper C5.B
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
Hard Problems on Random Graphs: Q/A Session B - Paper B3.C
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Timed games and deterministic separability: Q/A Session D - Paper D4.D
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Good-for-games ω-Pushdown Automata: Q/A Session F - Paper F4.A
Concurrent separation logic meets template games: Q/A Session A - Paper A6.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
The Strahler Number of a Parity Game: Q/A Session C - Paper C4.B
Approximating Values of Generalized-Reachability Stochastic Games: Q/A Session B - Paper B6.C
One-Clock Priced Timed Games are PSPACE-hard: Q/A Session C - Paper C5.B
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
Hard Problems on Random Graphs: Q/A Session B - Paper B3.C
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Timed games and deterministic separability: Q/A Session D - Paper D4.D
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Good-for-games ω-Pushdown Automata: Q/A Session F - Paper F4.A
Concurrent separation logic meets template games: Q/A Session A - Paper A6.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
The Strahler Number of a Parity Game: Q/A Session C - Paper C4.B
Approximating Values of Generalized-Reachability Stochastic Games: Q/A Session B - Paper B6.C
One-Clock Priced Timed Games are PSPACE-hard: Q/A Session C - Paper C5.B
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
Hard Problems on Random Graphs: Q/A Session B - Paper B3.C
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Timed games and deterministic separability: Q/A Session D - Paper D4.D
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Good-for-games ω-Pushdown Automata: Q/A Session F - Paper F4.A
Concurrent separation logic meets template games: Q/A Session A - Paper A6.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
The Strahler Number of a Parity Game: Q/A Session C - Paper C4.B