Theory

Subset Sum Problem Algorithms
So I was thinking about the subset sum problem and the case where the subset is bounded to only two numbers. This case is obviously not np- complete. Anyway for the fastest way to solve this specific case is something I want to know. I'm unsure if there are any books that delve into it but I know on the internet... 4 Apr 2008 17:26

Another approach to Decide Solvability of Univariate Integer Polynomials, and a possible Multivariate Extension
Hi All, I have updated my paper to Version_2 on "http://arxiv.org/abs/ 0803.0018". I request you to kindly take the time to read and offer me your comments, via email, or on the GoogleGroups comp.theory Thread having the same Title as the subject of this email. Some of the important changes I have made in t... 22 Apr 2008 03:09

Can someone explain the following calculations.
If I have the additive group (Z_65536,+) (i.e. integers between 0 and 65535 together with addition modulo 65536). How does Z_65536 does *not* form a group together with multiplication modulo 65536? Someone told me that no all integers have multiplicative inverses. They also told me that 3 does have a multiplic... 5 Apr 2008 13:12

Integer factorization, etc.
On 2 huhti, 15:46, "Dik T. Winter" <Dik.Win...(a)cwi.nl> wrote:  > Clearly N-ki = c^2 [c being complex integer] is a different  > kind of relationship. Actually it is not.  Finding k and c such that k = 2ad and c = a + di is the same as finding a and d such that N + d^2 = a^2. Well, this neglects the ... 22 Apr 2008 19:37

grammar ambiguity
Hi, Is there a way formally state in first-order logic that an arbitrary grammar is unambiguous? If so then could we run two algorithms in parallel - one which searches for an ambiguity in a grammar and the second which searches for a proof that the specified grammar is unambiguous. Both problems are undecidabl... 2 Apr 2008 10:04

Is your computer safe and secure!
Ask yourself... Is my computer performing as good as it used to (or could be)? Are all my files and programs really safe from all the constantly changing threats out there (or from total destruction)? Am I seriously going to pass up this chance to put all these concerns to rest once and for all...for less th... 1 Apr 2008 19:01

Shared Semantics for Dynamic Interface Discovery
There are a few protocols (both Application-level and Transport-level) out there that claim to be geared towards dynamic interface discovery (e.g. CORBA-DII). I have never been able to fathom the concept in its entirety. To me it appears that there is really not much you can do if you discover an interface about ... 8 Apr 2008 01:45

Asking advice
Please remember, I am NEW at trying to publish papers. When people are working on a paper they want to publish. How do they ask advice/questions and do they have to worry someone will take their idea and publish ahead of them? For example... let's imagine I had a good idea and I wanted to ask people questions a... 31 Mar 2008 17:58

Shared Semantics for Dynamic Interface Discovery
On Mar 30, 3:36 pm, Patricia Shanahan <p...(a)acm.org> wrote: sandeep6...(a)yahoo.com wrote: Each relational database manager I've used has come with an interactive utility that does various forms of inport and export, as well as executing any valid SQL operation on the database. That allows changes, as well... 31 Mar 2008 17:58

Proof of minimal colour in vertex colouring problem
I am doing a research about Graph colouring problem. As I known this problem is in NP-Complete, so I want to find the proof that show this problem is np-complete by show it is NP and it has reduce problem in NP problem as the definition said. Any suggestions are welcome where to find it or guideline to let me pro... 1 Feb 2008 00:48