Publication:3393339
From MaRDI portal
zbMath1178.68372MaRDI QIDQ3393339
Publication date: 20 August 2009
Boolean functions; combinatorial algorithms; integer partition; binary decision diagram; set partition; generation of combinatorial objects
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05A18: Partitions of sets
68W05: Nonnumerical algorithms
05A17: Combinatorial aspects of partitions of integers
68R05: Combinatorics in computer science
68R15: Combinatorics on words
05A05: Permutations, words, matrices
05C30: Enumeration in graph theory
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams, Pruned Discrete Random Samples, Influence of addition modulo \(2^n\) on algebraic attacks, Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations, Permutation pattern avoidance and the Catalan triangle, Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation, Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism, Counterexamples to the long-standing conjecture on the complexity of BDD binary operations, Concatenations of the hidden weighted bit function and their cryptographic properties, Best-order streaming model, The topology of isospectral manifolds of tridiagonal matrices, On the silhouette of binary search trees, Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities, On tree-growing search strategies, Determining the majority: The biased case, Normal convergence problem? Two moments and a recurrence may be the clues, Substitutions, coding prescriptions and integer representation, The number of winners in a discrete geometrically distributed sample, Distributional convergence for the number of symbol comparisons used by QuickSort, Faster compressed quadtrees, Product optimization in stepwise design, FPT algorithms to enumerate and count acyclic and totally cyclic orientations, Fast and simple compact hashing via bucketing, Eigenlogic in the spirit of George Boole, Constructing unlabelled lattices, DenseZDD: a compact and fast index for families of sets, On the error resilience of ordered binary decision diagrams, Towards a generic view of primality through multiset decompositions of natural numbers, The Boolean Constraint Solver of SWI-Prolog (System Description), Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams, Fast Compressed Tries through Path Decompositions, Algebraic Attacks Using Binary Decision Diagrams, πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space