Re: [algogeeks] Re: power set

2010-09-28 Thread TurksHead Education
Power set : http://www.rawkam.com/?p=330

On Sun, Sep 19, 2010 at 2:45 AM, Gene gene.ress...@gmail.com wrote:

 The power set of a set with N elements has size O(2^N).  You can't do
 anything with it in polynomial time.

 On Sep 18, 5:03 pm, bittu shashank7andr...@gmail.com wrote:
  can we solve power set in O(n) or O(nlogn)..is it posible...
 
  Regards
  Shashank

 --
 You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
 To post to this group, send email to algoge...@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
 .
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.



-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



[algogeeks] Re: power set

2010-09-18 Thread Gene
The power set of a set with N elements has size O(2^N).  You can't do
anything with it in polynomial time.

On Sep 18, 5:03 pm, bittu shashank7andr...@gmail.com wrote:
 can we solve power set in O(n) or O(nlogn)..is it posible...

 Regards
 Shashank

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.