Hi All,
Please try to provide solutions to the below problems.
1) For any given polynomial algorithm A for a decision problem, we can
associate a language L = { x | A(x) = 1 } i.e., all such inputs. If P
is the set of all such languages (remember polynomial time of A), is P
closed under Kleene St
A. M. G. Solo wrote:
> Watch Meet Your Meat from People for the Ethical Treatment of Animals (PETA):
> http://www.petatv.com/tvpopup/Prefs.asp?video=meet_your_meat
>
> 101 Reasons to be vegetarian:
> http://www.vivavegie.org/vv101/index.html
>
> Famous vegetarian athletes (list compiled by the In
eizhao... wrote
> wade wrote
>> [EMAIL PROTECTED] wrote:
>>> Is the solution always x = N-4, y = N-3, z = N-2 ?
>>> Suppose we are looking for x and y to minimize the sum.
>>> Sum = a[i]*x + a[j]*y, where 0 <= i <= x < j <= y <= N.
>>> It is always bigger than a[i]*x + a[j]*x, because x < y and al
you are right!!!
but i think there is a interesting thing hided in this problem.
let set[i] = {a[i]+b[1], a[i]+b[2], a[i]+b[3], ..., ai+an},
and MAX is the set of n largest numbers. if there
are some elements in the set[i] belong to the MAX,
we can know the number of these elements must be
less t
