scientific article

zbMath0637.68006MaRDI QIDQ3777423

Herbert S. Wilf

Publication date: 1986

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

zbMATH Keywords

complexitygraphgreatest common divisorfast Fourier transformcryptographyBibliographynetwork flow problemNP-completeexercisesmaximum independent setChinese remainder theorembacktrackingrecursive algorithmsquicksortfast matrix multiplicationextended Euclidean algorithmfour-color problemfactoring large integerspseudoprimality testtesting of primality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Software, source code, etc. for problems pertaining to number theory (11-04) Software, source code, etc. for problems pertaining to linear algebra (15-04) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (21)

An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling ⋮ Algorithmic procedure to compute abelian subalgebras and ideals of maximal dimension of Leibniz algebras ⋮ Origins of the analysis of the Euclidean algorithm ⋮ On CLIQUE Problem for Sparse Graphs of Large Dimension ⋮ Efficient bounds on a branch and bound algorithm for graph colouration ⋮ The hidden algorithm of Ore's theorem on Hamiltonian cycles ⋮ Oriented CW complexes and finite‐dimensional alternative algebras ⋮ Algorithmic method to obtain combinatorial structures associated with Leibniz algebras ⋮ Combinatorial structures of three vertices and Lie algebras ⋮ Algorithmic method to obtain abelian subalgebras and ideals in Lie algebras ⋮ Minimal faithful upper-triangular matrix representations for solvable Lie algebras ⋮ A fixed point operator for the generalised maximum satisfiability problem ⋮ Graph operations and Lie algebras ⋮ The travelling salesman problem: selected algorithms and heuristics† ⋮ FAST EXPONENTIAL-TIME ALGORITHMS FOR THE FOREST COUNTING AND THE TUTTE POLYNOMIAL COMPUTATION IN GRAPH CLASSES ⋮ COMPUTING THE LAW OF A FAMILY OF SOLVABLE LIE ALGEBRAS ⋮ On the rapid computation of various polylogarithmic constants ⋮ A network-flow-based lower bound for the minimum weighted integer coloring problem ⋮ The maximum clique problem ⋮ Lower bounds for constant degree independent sets ⋮ Algorithm to compute minimal matrix representation of nilpotent lie algebras

This page was built for publication: