scientific article; zbMATH DE number 3388544
From MaRDI portal
Publication:5657656
zbMath0245.68012MaRDI QIDQ5657656
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01) Algorithms in computer science (68W99) Probabilistic methods, stochastic differential equations (65C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (16)
The Ford-Johnson algorithm still unbeaten for less than 47 elements ⋮ Two backtrack algorithms for the ratio frequency intermodulation problem ⋮ On the correct implementation of the Hanurav-Vijayan selection procedure for unequal probability sampling without replacement ⋮ The unified data structure capability in Madcap VI ⋮ Generating the Nine-Point Graphs ⋮ The gold partition conjecture for 6-thin posets ⋮ On the cardinalities of finite topologies ⋮ The number of 9x9 Latin squares ⋮ Efficient memo-table management strategies ⋮ An analysis of alpha-beta pruning ⋮ A note on the proportion of singular (0,1)-matrices in a class associated with fractional \(2^n\) factorial designs ⋮ An algorithm for Gray codes ⋮ Lower bound for the connective constant of a self-avoiding walk on a square lattice ⋮ Multidimensional scaling of measures of distance between partitions ⋮ Group Ramsey theory ⋮ Fast algorithms for genegrating integer partitions
This page was built for publication:
