Results 171 to 180 of about 8,826,545 (192)
Revisiting Explicit Enumeration for Exact Synthesis
The problem of generating a minimal implementation of a given Boolean function is called exact synthesis. The parameter to be minimized is often the total number of gates used for the implementation.
Görschwin Fey +2 more
exaly +4 more sources
Exact Enumeration of Satisfiable 2-SAT Formulae [PDF]
We obtain exact expressions counting the satisfiable 2-SAT formulae and describe the structure of associated implication digraphs. Our approach is based on generating function manipulations.
Dovgal, Sergey +2 more
exaly +2 more sources
We have found that there are more than a dozen classical generating functions that could be suitably symbolized to yield various symbolic sum formulas by employing the Mullin–Rota theory of binomial enumeration.
Tian-Xiao He +2 more
exaly +1 more source
Some of the next articles are maybe not open access.
Exact Enumeration of Cherries and Pitchforks in Ranked Trees Under the Coalescent Model
Mathematical Biosciences, 2013Thomas Wiehe
exaly
Exact Enumeration of Rooted 3-Connected Triangular Maps on the Projective Plane (Extended Abstract)
Electronic Notes in Discrete Mathematics, 2001Zhicheng Gao
exaly
Singularity Analysis of Generating Functions
SIAM Journal on Discrete Mathematics, 1990Andrew Odlyzko, Philippe Flajolet
exaly

