A Beautiful Technique for Some XOR Related Problems
codeforces.com
A Beautiful Technique for Some XOR Related Problems
1–8 of 8 posts
Re: A Beautiful Technique for Some XOR Related Problems
#2Read this to instantly annihilate Project Euler problems
Re: A Beautiful Technique for Some XOR Related Problems
#3Read this to instantly annihilate Project Euler problems
The fraction of Project Euler problems "annihilated" by knowing that XOR = addition in finite-dimensional vector spaces over F_2 is extremely close to zero. [EDITED to add:] (I'm not sure it isn't exactly zero but haven't checked.)
Re: A Beautiful Technique for Some XOR Related Problems
#4Read this to instantly annihilate Project Euler problems
The fraction of Project Euler problems "annihilated" by knowing that XOR = addition in finite-dimensional vector spaces over F_2 is extremely close to zero. [EDITED to add:] (I'm not sure it isn't exactly zero but haven't checked.)
no but it will help you understand ML compilers :)
https://github.com/triton-lang/triton/blob/main/include/trit...
Re: A Beautiful Technique for Some XOR Related Problems
#5[flagged]
Re: A Beautiful Technique for Some XOR Related Problems
#6Related: XOR, 3 months ago, 100 comments, 602 points. https://news.ycombinator.com/item?id=43087944
Re: A Beautiful Technique for Some XOR Related Problems
#7Earlier quoted context omitted.
The fraction of Project Euler problems "annihilated" by knowing that XOR = addition in finite-dimensional vector spaces over F_2 is extremely close to zero. [EDITED to add:] (I'm not sure it isn't exactly zero but haven't checked.)
no but it will help you understand ML compilers :) https://github.com/triton-lang/triton/blob/main/include/trit...
https://arxiv.org/abs/2505.23819 is probably a better read (though it still has some typos)