The product of big two primes is NP or NP Complete????I know that is NP but i dont know if itīs NP Complete.....do you undestand the implication of this?? ...
... Computing the product of two numbers is in P. The complexity of factorization is unknown but probably not NP. Factorization in NP would imply NP = co-NP...
Two questions I would like to ask : ___________________________________ 1. What kind of grammar should be used for Natural Language Processing? 2. How can Real...
... The complexity of factorization is unknown but probably not NP. realy???In general case or only to two factors???? ...Factorization in NP would imply NP =...
Hello friends, My comp has a global IP. 203.212.229.86. I would like to connect to my friends computer which is in a hathway network under a gatway. he has a...
Hello friends, My comp has a global IP. 203.212.229.86. I would like to connect to my friends computer which is in a hathway network under a gatway. he has a...
1. Your friends gateway would have to support some form of VPN 2. This is not the correct forum for this. ... -- G. Waleed Kavalec ... Copyright: G. Waleed...
I am not an expert on Complexity Theory, but here's my tu'penni'orth. The problem of testing whether a number is prime (Primality Testing) is known to be in P,...
On Wednesday, May 11, 2005 6:57 AM, manoj_333 wrote in comp-sci-theory: M>> For primes, since we now know recognition can be done in polynomial time, we're...
hi ! I try to solve the following problem : find the set of n integers {x_i} which maximises : E = sum_on_i (x_i a_i) such that sum_on_i (x_i b_i)^2 <= T the...
sese demus
tlon_urbis@...
May 11, 2005 5:29 pm
2067
ok...factorization is NP, but factorization is NP complete(or at least a conjecture)?? Bhupinder Singh Anand <re@...> escreveu:On Wednesday, May 11,...
I have the following expression ((a|b)(c|d))+ This means that the words allowed are ac +,ad +,bc +,bd + Right? So if had to create a Deterministic Finite ...
Itīs obviously an NP-hard problem. It looks like the knapsack problem in which ou can only take a certain weight of each item (only in this case itīs the...
Iīm sorry, I didnīt realize it was the square of the product in: (SUM (x_i b_i)^2 <= T) So the algorithm in the previous e-mail is wrong. The nonlinearity...
(q0,a,q1)(q0,b,q2) (q1,c,q3)(q1,d,q3) (q2,c,q3)(q2,d,q3) These states were included since we had to have atleast one such term (q3,a,q1)(q3,b,q2) Here q3 is...
Bidirectional Associative Memory. I have raised a couple of points on Greedy methods in contemporary computing & NLP and RTRL. Hope somebody would care to...
thx for reply. i'm so happy i found someone who knows about BAM finally. Actually i need some help if possible. i was wondering about 1-the global stability of...
I know that the union of finite decidable langs is still decidable, but how about union of inifinitely many decidable langs? Can anyone clarify this for me? ...
... but ... clarify ... Halting problem is undecidable and can be represented as an infinite union of decidable languages. The trivial language {0,1}* is...
... I am not quite clear, is that means the union is not always decidable. Also, the union is always smei-decidale, right? Coz an input will eventually get...
Hope I am not mixing up. I am responding to two different mails at one go. Since the union of 2 decidable languages is decidable, the class of decidable...
... decidable, ... anyone ... infinite ... represented as ... decidable. ... Any infinite language L can be written as a countably infinite union of decidable...
I am sorry, Induction would not apply here. But DeMorgan's laws of logic would be more appropriate. First the matter of indexing and cardinality: the Morgan's...
On Thursday, June 02, 2005 12:18 PM, Michael N. Christoff wrote in comp-sci-theory: MC>> But doesn't induction show that for any finite n decidable languages,...
On Saturday, June 04, 2005 3:40 AM, Michael N. Christoff wrote in comp-sci-theory: MC>> I think it proves the same thing in either case (computational or...
I see. I'm glad I didn't have to discuss the meaning of induction with you :) But, you're very right in that as far as philosophy of mathematics goes,...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
