scientific article

zbMath1178.68372MaRDI QIDQ3393339

Donald E. Knuth

Publication date: 20 August 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Boolean functionscombinatorial algorithmsinteger partitionbinary decision diagramset partitiongeneration of combinatorial objects

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Partitions of sets (05A18) Nonnumerical algorithms (68W05) Combinatorial aspects of partitions of integers (05A17) Combinatorics in computer science (68R05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (33)

Influence of addition modulo \(2^n\) on algebraic attacks ⋮ FPT algorithms to enumerate and count acyclic and totally cyclic orientations ⋮ Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations ⋮ Pruned Discrete Random Samples ⋮ On tree-growing search strategies ⋮ Determining the majority: The biased case ⋮ Permutation pattern avoidance and the Catalan triangle ⋮ Fast and simple compact hashing via bucketing ⋮ Algebraic Attacks Using Binary Decision Diagrams ⋮ Eigenlogic in the spirit of George Boole ⋮ Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation ⋮ Distributional convergence for the number of symbol comparisons used by QuickSort ⋮ Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism ⋮ A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams ⋮ Counterexamples to the long-standing conjecture on the complexity of BDD binary operations ⋮ Concatenations of the hidden weighted bit function and their cryptographic properties ⋮ Towards a generic view of primality through multiset decompositions of natural numbers ⋮ πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space ⋮ Substitutions, coding prescriptions and integer representation ⋮ Best-order streaming model ⋮ On the silhouette of binary search trees ⋮ Constructing unlabelled lattices ⋮ The Boolean Constraint Solver of SWI-Prolog (System Description) ⋮ Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams ⋮ The number of winners in a discrete geometrically distributed sample ⋮ Fast Compressed Tries through Path Decompositions ⋮ The topology of isospectral manifolds of tridiagonal matrices ⋮ Normal convergence problem? Two moments and a recurrence may be the clues ⋮ Faster compressed quadtrees ⋮ DenseZDD: a compact and fast index for families of sets ⋮ Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities ⋮ On the error resilience of ordered binary decision diagrams ⋮ Product optimization in stepwise design

This page was built for publication: