zweidimensionales bewegtes Bild
One-Clock Priced Timed Games are PSPACE-hard: Q/A Session C - Paper C5.B
- Location
-
Hannover TIB
- Extent
-
37MB, 00:22:03:21 (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
-
Ibsen-Jensen, Rasmus
Fearnley, John
Savani, Rahul
- DOI
-
10.5446/49290
- 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
- Ibsen-Jensen, Rasmus
- Fearnley, John
- Savani, Rahul
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
Timed games and deterministic separability: Q/A Session D - Paper D4.D
Learning One-Clock Timed Automata
Learning One-Clock Timed Automata
Clock Bound Repair for Timed Systems
Monitoring CTMCs by Multi-clock Timed Automata
Hard Problems on Random Graphs: Q/A Session B - Paper B3.C
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Panel Session Day Two: Q&A
Bounded DBM-based clock state construction for timed automata in Uppaal
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Re-pairing brackets: Q/A Session F - Paper F4.D
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Timed games and deterministic separability: Q/A Session D - Paper D4.D
Learning One-Clock Timed Automata
Learning One-Clock Timed Automata
Clock Bound Repair for Timed Systems
Monitoring CTMCs by Multi-clock Timed Automata
Hard Problems on Random Graphs: Q/A Session B - Paper B3.C
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Panel Session Day Two: Q&A
Bounded DBM-based clock state construction for timed automata in Uppaal
Qa- [Qa-]
Re-pairing brackets: Q/A Session F - Paper F4.D
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Timed games and deterministic separability: Q/A Session D - Paper D4.D
Learning One-Clock Timed Automata
Learning One-Clock Timed Automata
Clock Bound Repair for Timed Systems
Monitoring CTMCs by Multi-clock Timed Automata
Hard Problems on Random Graphs: Q/A Session B - Paper B3.C
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Panel Session Day Two: Q&A
Bounded DBM-based clock state construction for timed automata in Uppaal
Qa- [Qa-]
Re-pairing brackets: Q/A Session F - Paper F4.D