zweidimensionales bewegtes Bild
Counting homomorphisms in plain exponential time: Q/A Session B - Paper B1.E
- Location
-
Hannover TIB
- Extent
-
42MB, 00:26:20:18 (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
-
Bulatov, Andrei
Dadsetan, A.
- DOI
-
10.5446/49354
- 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
- Bulatov, Andrei
- Dadsetan, A.
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Counting solutions to random CNF formulas: Q/A Session A - Paper A3.A
Two variable logic with ultimately periodic counting: Q/A Session C - Paper C4.C
Counting perfect matchings and the eight-vertex model: Q/A Session B - Paper B1.B
Panel Session Day Two: Q&A
Hardness of equations over finite solvable groups under the exponential time hypothesis: Q/A Session C - Paper C2.B
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Counting solutions to random CNF formulas: Q/A Session A - Paper A3.A
Two variable logic with ultimately periodic counting: Q/A Session C - Paper C4.C
Counting perfect matchings and the eight-vertex model: Q/A Session B - Paper B1.B
Panel Session Day Two: Q&A
Hardness of equations over finite solvable groups under the exponential time hypothesis: Q/A Session C - Paper C2.B
Qa- [Qa-]
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E
Proportionally Fair Clustering Revisited: Q/A Session C - Paper C1.E
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
Counting solutions to random CNF formulas: Q/A Session A - Paper A3.A
Two variable logic with ultimately periodic counting: Q/A Session C - Paper C4.C
Counting perfect matchings and the eight-vertex model: Q/A Session B - Paper B1.B
Panel Session Day Two: Q&A
Hardness of equations over finite solvable groups under the exponential time hypothesis: Q/A Session C - Paper C2.B
Qa- [Qa-]
Symmetric Arithmetic Circuits: Q/A Session C - Paper C2.A
Re-pairing brackets: Q/A Session F - Paper F4.D
Making Streett Determinization Tight: Q/A Session F - Paper F4.B
Faster Dynamic Range Mode: Q/A Session D - Paper D2.E