The following pages link to (Q3932310):
Displaying 50 items.
- Closed expressions for averages of set partition statistics (Q289685) (← links)
- Enumerative encoding of correlation-immune Boolean functions (Q386997) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Enumeration and generating functions of Rota-Baxter words. (Q541977) (← links)
- Enumeration and generating functions of differential Rota-Baxter words. (Q541978) (← links)
- Generating alternating permutations lexicographically (Q583885) (← links)
- Invariant norm quantifying nonlinear content of Hamiltonian systems (Q606806) (← links)
- Calculation of the permanent of a sparse positive matrix (Q709358) (← links)
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589) (← links)
- An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
- Counting and generating permutations in regular classes (Q727971) (← links)
- Genealogical-tree probabilities in the infinitely-many-site model (Q753709) (← links)
- Expected frequency and mean size of the paradox of new members (Q792195) (← links)
- The dual variable method for solving fluid flow difference equations on Delaunay triangulations (Q806478) (← links)
- Parallel sorting on Cayley graphs (Q807014) (← links)
- Efficient enumeration of words in regular languages (Q840765) (← links)
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
- The construction of optimal designs for dose-escalation studies (Q892451) (← links)
- An example of two homeomorphic, nondiffeomorphic complete intersection surfaces (Q919435) (← links)
- The limiting distribution of the trace of a random plane partition (Q955189) (← links)
- Exact solution of two classes of prudent polygons (Q966134) (← links)
- Binary self-dual codes with automorphisms of order 23 (Q1009033) (← links)
- The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) (← links)
- Gray-Codes (Q1055391) (← links)
- Rekursive Erzeugung aller Partitionen einer endlichen Menge (Q1059080) (← links)
- The generation of random, binary unordered trees (Q1068492) (← links)
- Counting genealogical trees (Q1107468) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- Chromatic polynomials for regular graphs and modified wheels (Q1150375) (← links)
- Runge-Kutta methods for quadratic ordinary differential equations (Q1267024) (← links)
- Listing graphs that satisfy first-order sentences (Q1337473) (← links)
- Markov chains for Monte Carlo tests of genetic equilibrium in multidimensional contingency tables (Q1355173) (← links)
- Degeneracy in heteroscedastic regression models (Q1587364) (← links)
- Evaluating matrix-variate moments through higher-order differential forms and combinatorial algorithms. (Q1589677) (← links)
- Time-efficient estimation of conditional mutual information for variable selection in classification (Q1623393) (← links)
- Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer (Q1679226) (← links)
- Ordering of nested square roots of 2 according to the Gray code (Q1696813) (← links)
- On the shape of random Pólya structures (Q1699530) (← links)
- Multinomial interpoint distances (Q1706476) (← links)
- On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
- A faster exact-counting protocol for anonymous dynamic networks (Q1755728) (← links)
- Boltzmann samplers for first-order differential specifications (Q1759830) (← links)
- Consensus of partitions: a constructive approach (Q1761306) (← links)
- Gray code enumeration of families of integer partitions (Q1805052) (← links)
- Phorma: perfectly hashable order restricted multidimensional arrays (Q1827865) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- Short proof that Kneser graphs are Hamiltonian for \(n \geqslant 4k\) (Q2032752) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Fast verification of masking schemes in characteristic two (Q2056733) (← links)
