C A L LF O RP A P E R S
===
The 2009 International Conference on
Foundations of Computer Science
FCS'09
Date and Location: July 13-16, 2009, Las Vegas, USA
http:
so the permanent is like determinant but without sign in summand.
I have found something interesting in your peoblem.
It is NP-complete if you have n=2, and numbers are powers of two, but on
input is only exponent.
som if there is number 2^100, only 100 is on input. One can directly reduce
MAX-PA
I don't have polynomial algorithm for this problem, after asking for
help from many persons who are skilled at algorithm design.
So I suspect this problem is another NP-complete problem.
Your hint is great that this problem is possibly neither NP-complete
nor P.
You says, "The only problem i know
Draft paper submission deadline extended (will not be extended
further): TMFCS-09
The deadline for draft paper submission at the 2009 International
Conference on Theoretical and Mathematical Foundations of Computer
Science (TMFCS-09) (website: http://www.PromoteResearch.org ) is
extended due to
After asking for helps from many persons who are skilled at algorithm
design, I suspect this problem is a NP-complete.
The only problem you speak of which contains multiplication is
computing a "permanent", what is this problem?
could you post any details or links about it?
You are probably right
