The following pages link to (Q4234989):
Displaying 47 items.
- Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255) (← links)
- Influence of certain transpositions on the cyclic structure of permutations (Q269150) (← links)
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- Efficient approximate verification of B and Z models via symmetry markers (Q622591) (← links)
- Weighing matrices and string sorting (Q659805) (← links)
- A branch-and-bound approach for maximum quasi-cliques (Q744705) (← links)
- Hanoi graphs and some classical numbers (Q813952) (← links)
- An efficient string sorting algorithm for weighing matrices of small weight (Q845549) (← links)
- On acyclic molecular graphs with prescribed numbers of edges that connect vertices with given degrees (Q862886) (← links)
- Containment properties of product and power graphs (Q868386) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- The relevant prefixes of coloured Motzkin walks: an average case analysis (Q1041231) (← links)
- Algorithms for generating convex sets in acyclic digraphs (Q1044043) (← links)
- Group testing for consecutive positives (Q1306739) (← links)
- Ranking and unranking permutations in linear time (Q1603397) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- A novel approach to perturbative calculations for a large class of interacting boson theories (Q1695942) (← links)
- Computing low-weight discrete logarithms (Q1746959) (← links)
- An efficient design and implementation of the in-parameter-order algorithm (Q1993364) (← links)
- Efficient linear-time ranking and unranking of derangements (Q2094363) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- Energy-momentum conserving integration schemes for molecular dynamics (Q2241865) (← links)
- Description and generation of permutations containing cycles (Q2247815) (← links)
- Workweek optimization of experimental designs: exact designs for variable sampling costs (Q2260184) (← links)
- Generating combinatorial sets with given properties (Q2263238) (← links)
- Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597) (← links)
- A survey on the problems and algorithms for covering arrays via set covers (Q2333829) (← links)
- Stern polynomials (Q2383531) (← links)
- Towards a generic view of primality through multiset decompositions of natural numbers (Q2453539) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations (Q2502171) (← links)
- Analytical distribution of waiting time in the M/\{iD\}/1 queue (Q2572908) (← links)
- On generation of permutations of \(m\) out of \(n\) items (Q2628264) (← links)
- Block-cyclic structuring of the basis of Fourier transforms based on cyclic substitution (Q2668536) (← links)
- A tutorial on the balanced minimum evolution problem (Q2670555) (← links)
- Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem (Q2759107) (← links)
- Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)
- A mathematical programming approach to the construction of BIBDs (Q2995501) (← links)
- <i>q</i>-Analogs of Packing Designs (Q3191439) (← links)
- Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices (Q3453110) (← links)
- (Q4616107) (← links)
- Slope packings and coverings, and generic algorithms for the discrete logarithm problem (Q4798160) (← links)
- Some problems and algorithms related to the weight order relation on the n-dimensional Boolean cube (Q5013468) (← links)
- (Q5241126) (← links)
- Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs (Q5265798) (← links)
- Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings) (Q5398315) (← links)
- Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)
