activity
20092026
most citedCounting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields

8 citations · 11 across the 9 of their papers we have counts for

collaborators
Showing 2023 · cs.DMShow all

1 paper · 2 filters

cs.DM2023

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs

Martin Pépin, Alfredo Viola

Directed acyclic graphs (DAGs) are directed graphs in which there is no path from a vertex to itself. DAGs are an omnipresent data structure in computer science and the problem of…