Parallel algorithm for matroid basis computation with O(n^{1/3} log^{1/3} n) round complexity, nearly matching the KUW lower bound.
Symmetric Weighted First-Order Model Counting
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Cofola language and three-phase compiler reduce combinatorial counting problems to practical WFOMC instances while preserving symmetries.
citing papers explorer
-
Solving Combinatorial Counting Problems with Weighted First-Order Model Counting
Cofola language and three-phase compiler reduce combinatorial counting problems to practical WFOMC instances while preserving symmetries.