On the sizes of BDDs and ZDDs representing matroids

Documenti analoghi

• Algorithmic aspects of semistability of quiver representations
  di: Iwamasa, Yuni, et al.
  Pubblicazione: (2024)
• EPTAS for Hard Graph Cut Problems for Dense Graphs
  di: Deguchi, Kaisei, et al.
  Pubblicazione: (2026)
• Approximating maximum-size properly colored forests
  di: Bai, Yuhang, et al.
  Pubblicazione: (2024)
• Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
  di: Alecu, Bogdan, et al.
  Pubblicazione: (2024)
• Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
  di: Bencs, Ferenc, et al.
  Pubblicazione: (2024)