zweidimensionales bewegtes Bild
Counting homomorphisms in plain exponential time: Q/A Session B - Paper B1.E
- Standort
-
Hannover TIB
- Umfang
-
42MB, 00:26:20:18 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Bulatov, Andrei
Dadsetan, A.
- DOI
-
10.5446/49354
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Bulatov, Andrei
- Dadsetan, A.
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (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
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
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
A Cellular Howe Theorem: Q/A Session E - Paper E6.A
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
A Cellular Howe Theorem: Q/A Session E - Paper E6.A