zweidimensionales bewegtes Bild
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
- Standort
-
Hannover TIB
- Umfang
-
220MB, 00:24:12:24 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 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
-
Grohe, Martin
- DOI
-
10.5446/49298
- 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
- Grohe, Martin
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Bounded degree spanning trees
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs: Q/A Session E - Paper E3.E
Counting, grafting and evolving binary trees
Bounded variable logics and counting : a study in finite models
Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming: Q/A Session F - Paper F2.B
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Proof of the tree packing conjecture for bounded degree trees
Counting solutions to random CNF formulas: Q/A Session A - Paper A3.A
Counting homomorphisms in plain exponential time: Q/A Session B - Paper B1.E
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
Bounded degree spanning trees
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs: Q/A Session E - Paper E3.E
Counting, grafting and evolving binary trees
Bounded variable logics and counting : a study in finite models
Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming: Q/A Session F - Paper F2.B
Qa- [Qa-]
Proof of the tree packing conjecture for bounded degree trees
Counting solutions to random CNF formulas: Q/A Session A - Paper A3.A
Counting homomorphisms in plain exponential time: Q/A Session B - Paper B1.E
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
Bounded degree spanning trees
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs: Q/A Session E - Paper E3.E
Counting, grafting and evolving binary trees
Bounded variable logics and counting : a study in finite models
Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming: Q/A Session F - Paper F2.B
Qa- [Qa-]
Proof of the tree packing conjecture for bounded degree trees
Counting solutions to random CNF formulas: Q/A Session A - Paper A3.A
Counting homomorphisms in plain exponential time: Q/A Session B - Paper B1.E
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
Spectral Sparsification via Bounded-Independence Sampling: Q/A Session D - Paper D3.B