Submodular maximization is a significant area of interest in combinatorial optimization, with numerous real-world applications. A research team led by Xiaoming SUN from the State Key Lab of Processors ...

The old Babylonian algorithm, a remarkable mathematical artifact from ancient Mesopotamia (around 1800–1600 BC), has long been a subject of fascination to scholars. This ancient algorithm not only ...

Recursive Depth-First Search (DFS) algorithm solution to the knapsack problem hand-written in C. Interactive C-based application for solving and visualizing the Tower of Hanoi problem. Features ...

ABSTRACT: For decades, Lychrel numbers have been studied on many bases. Their existence has been proven in base 2, 11 or 17. This paper presents a probabilistic proof of the existence of Lychrel ...

Abstract: Based on the Boolean matrix in literature, the paper puts forward a non-recursive algorithm to change conjunctive normal form into disjunctive normal form, thus all attribute reductions are ...

Add a description, image, and links to the recursion-algorithm topic page so that developers can more easily learn about it.