Sep 17, 2008 · Abstract: The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, ...
The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P( ...
On an algorithm that generates an interesting maximal set P(n) of the naturals for any n greater than or equal to 2. CoRR abs/0809.2884 (2008). [+] ...
Jul 17, 2024 · Given a number N as string, find the smallest number that has same set of digits as N and is greater than N.
On an algorithm that generates an interesting maximal set P(n) of the naturals for any n greater than or equal to 2 · Bidu Prakash Das,Soubhik Chakraborty ...
This paper defines an algorithmic procedure for each activity, and discusses to which degree each activity can be automated. The generalization activity ( ...
Dec 30, 2008 · I need to generate all partitions of a number N. Each partition corresponds to a different distribution, and therefore a different "coverage" ...
First, we consider a simple greedy algorithm for the unweighted problem. Theorem 2 Greedy outputs an independent set S such that |S| ≥ n/(∆ + 1) where ∆ is ...
Apr 10, 2024 · If the remainder is 2, the maximum product is 2 multiplied by 3 raised to the power of N/3. Return the value of maxProduct. Below is the ...
Feb 11, 2011 · The MIS problem is the following: given a graph G = (V,E) find an independent set in G of maximum cardinality. In the weighted case, each ...
Missing: generates | Show results with:generates