Advanced SearchPreferences Search:  all groups  Google Groups
 Groups Results 1 - 10 of about 92 for "exponential-time algorithm".
 Sorted by relevance    Sort by date

algorithm - Polynomial time and exponential time - Stack Overflow
 3 posts  -  4 authors  - Last post:  Nov 30, 2010 I have a question that what is the difference between polynomial time algorithm non polynomial time algorithm and exponential time algorithm ...http://stackoverflow.com/questions/4317414/polynomial-time-and-exponential-time

Power assignment
 -  16 posts  -  7 authors  - Last post:  Nov 18, 1999 I'm not claiming this particular program is an optimal implementation of an exponential time algorithm. (I believe many commerical linear programs are quite fast ...http://groups.google.com/g/b627ff07/t/.../d/af1d96fc445ee593?hl=en&ie...

Improve speed of a perl-script ... and efficiency info.
 -  9 posts  -  9 authors  - Last post:  Jan 8, 1999 Eric Bohlman ebohl...@netcom.com comp lang perl misc Dan Wilga wrote: Personally, I've found that once the size of a ...http://groups.google.com/g/f517ff05/t/.../d/e66df1848315d4fe?hl=en&ie...

Exact solutions to NP complete problems: Summary (MODERATELY ...
 -  1 post  -  1 author  - Last post:  Jan 24, 1994 In many cases, the problem is small enough that a clever and carefully implemented exponential time algorithm can solve the problem. You'll find that there is ...http://groups.google.com/g/c9d7ff07/t/.../d/69a45ccc15c15279?hl=en&ie...

New Linear Programming Alogrithm
 -  2 posts  -  2 authors  - Last post:  Dec 10, 1984 This is because the simplex method is an exponential time algorithm, with the solution time increasing as an exponential function of the size of the problem.http://groups.google.com/g/97c7fea3/t/.../d/fd2f155c96dd099d?hl=en&ie...

Factoring
 -  8 posts  -  8 authors  - Last post:  Jul 9, 2001 This is the exponential time algorithm for NP problems. Notice too that all polynomial-time solvalbe problems are also in NP because they can be verifies in ...http://groups.google.com/g/a807ff04/t/.../d/cd7a685a1307bdca?hl=en&ie...

Research report
 -  1 post  -  1 author  - Last post:  Jan 24, 1997 btoback btob...@OPTC.COM comp sys hp mpe Hi all, In a post from January 18, Wirt Atmar noted that he doesn't believe that computers will reach the HAL ...http://groups.google.com/g/9167fef9/t/.../d/f54412321f670b04?hl=en...8...

HW6: Other data structures and runtime
 -  2 posts  -  2 authors  - Last post:  Mar 11, 2003 ... and saying you have aO(|V|+|E|) time algorithm would beg the question of how |V| and |E| are related to n (if |E|=2^n, then that's an exponential time algorithm, ...http://groups.google.com/g/68b7fef5/t/.../d/aa2b110a7a24cfb4?hl=en&ie...

Public Key Crypto in Public Domain?
 -  33 posts  -  21 authors  - Last post:  Nov 21, 1996 A sub-exponential time algorithm for them would be a major break-through. Incorrect. A -polynomial- time algorithm would be a breakthrough. An algorithm can ...http://groups.google.com/g/ad07fef6/t/.../d/ff5f6d1e46422e1c?hl=en&ie...

computers ltd.- time analysis for algorithms and intractability
 -  10 posts  -  7 authors  - Last post:  May 6, 2010 stephen tarzia ... nu-cs101 mohini tellakat wrote: thanks for the clarifications everyone! so if i am understanding this correctly, a bad ...http://groups.google.com/g/6727fc38/t/.../d/2cee018e3bcb0148?hl=en...8...