zweidimensionales bewegtes Bild
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
- Standort
-
Hannover TIB
- Umfang
-
26MB, 00:18:57:26 (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
-
Doumane, Amina
Bojańczyk, Mikołaj
- DOI
-
10.5446/49292
- 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
- Doumane, Amina
- Bojańczyk, Mikołaj
- 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
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
First-Order Definability of Trees and Sparse Random Graphs
Learning from forest trees: improving urban tree biomass functions
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
Expressivity and decidability of first-order languages over feature trees
Expressivity and decidability of first-order languages over feature trees
Computing measures of weak-MSO definable sets of trees: Q/A Session F - Paper F3.C
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata: Q/A Session F - Paper F3.A
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
First-Order Definability of Trees and Sparse Random Graphs
Learning from forest trees: improving urban tree biomass functions
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
Expressivity and decidability of first-order languages over feature trees
Expressivity and decidability of first-order languages over feature trees
Computing measures of weak-MSO definable sets of trees: Q/A Session F - Paper F3.C
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata: Q/A Session F - Paper F3.A
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
First-Order Definability of Trees and Sparse Random Graphs
Learning from forest trees: improving urban tree biomass functions
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
Expressivity and decidability of first-order languages over feature trees
Expressivity and decidability of first-order languages over feature trees
Computing measures of weak-MSO definable sets of trees: Q/A Session F - Paper F3.C