zweidimensionales bewegtes Bild
Property Testing of LP-Type Problems: Q/A Session E - Paper E2.F
- Location
-
Hannover TIB
- Extent
-
42MB, 00:23:16:03 (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
-
Silwal, Sandeep
Epstein, Rogers
- DOI
-
10.5446/49423
- 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
- Silwal, Sandeep
- Epstein, Rogers
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
Panel Session Day Two: Q&A
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
On Computability of Logical Approaches to Branching-Time Property Verification of Programs: Q/A Session D - Paper D6.F
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Panel Session Day Two: Q&A
Qa- [Qa-]
On Computability of Logical Approaches to Branching-Time Property Verification of Programs: Q/A Session D - Paper D6.F
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A
On polynomial recursive sequences: Q/A Session A - Paper A4.C
Panel Session Day Two: Q&A
Qa- [Qa-]
On Computability of Logical Approaches to Branching-Time Property Verification of Programs: Q/A Session D - Paper D6.F
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
On Higher-Order Cryptography: Q/A Session B - Paper B4.D
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
Multimodal Dependent Type Theory: Q/A Session B - Paper B5.A