Results 171 to 180 of about 8,826,545 (192)

Revisiting Explicit Enumeration for Exact Synthesis

open access: yes, 2020
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]

open access: yesCombinatorial Theory, 2023
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

Symbolization of Generating Functions; An Application of the Mullin–Rota Theory of Binomial Enumeration

open access: yesComputers and Mathematics With Applications, 2007
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.

Central and Local Limit Theorems Applied to Asymptotic Enumeration IV: Multivariate Generating Functions

Journal of Computational and Applied Mathematics, 1992
Zhicheng Gao, L Bruce Richmond
exaly  

Singularity Analysis of Generating Functions

SIAM Journal on Discrete Mathematics, 1990
Andrew Odlyzko, Philippe Flajolet
exaly  

Home - About - Disclaimer - Privacy