Maximum XOR subsequence

Revision en1, by force_awakens, 2017-06-16 12:40:07

We can solve the maximum (AND) subsequence of an array by checking the common bits in numbers in O(nlogn).But how can we find a susequence with maximum XOR?

Tags xor, bit manipulation, #math

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English force_awakens 2017-06-16 12:40:07 179 Initial revision (published)