Eliminating recursion from combinatoric procedures

DOI10.1002/spe.4380110804zbMath0459.68034OpenAlexW1976816422MaRDI QIDQ3910013

Jeffrey S. Rohl

Publication date: 1981

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.4380110804

zbMATH Keywords

set covering problemprogram transformationbacktrackingtopological sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Discrete mathematics in relation to computer science (68R99) Theory of software (68N99)

Related Items (2)

Evaluating systems of equations: Toward a formal approach ⋮ An iterative algorithm for the cyclic Towers of Hanoi problem

Cites Work

• Notes on recursion elimination

This page was built for publication: Eliminating recursion from combinatoric procedures