תקציר
The paper investigates relationships between algebraic ex-pressions and graphs. Using the decomposition method we generate spe-cial simultaneous systems of linear recurrences for sizes of graph expres-sions. We propose techniques which provide closed-form solutions for these systems.
שפה מקורית | אנגלית |
---|---|
עמודים (מ-עד) | 104-108 |
מספר עמודים | 5 |
כתב עת | CEUR Workshop Proceedings |
כרך | 1949 |
סטטוס פרסום | פורסם - 2017 |
אירוע | Joint 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic, ICTCS 2017 and CILC 2017 - Naples, איטליה משך הזמן: 26 ספט׳ 2017 → 28 ספט׳ 2017 |