Math -> XOR Basis / Linear Basis
Gaussian elimination over GF(2) for subset-xor span, representability, maximum subset xor, and cycle-space xor reductions.
- Topic slug:
math/xor-basis
- Tutorial page: Open tutorial
- Ladder page: Open ladder
- Repo problems currently tagged here:
1
- Repo companion pages:
4
- Curated external problems:
3
Microtopics
- xor-basis
- linear-basis
- gf2-elimination
- maximum-subset-xor
- representability
- cycle-space-xor
Learning Sources
Practice Sources
Repo Companion Material
Curated External Problems
Core
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| XMAX - XOR Maximization |
SPOJ |
Medium |
Bitwise Algebra |
Math; Implementation |
Bitwise Operations; Greedy Elimination; Subset XOR |
Linear-Basis; Maximum-Subset-XOR |
The cleanest first benchmark where a linear basis replaces brute-force subset xor search entirely. |
Stretch
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| Shortest Path Problem? |
Codeforces |
Hard |
Graphs/Cycle XOR, Bitwise Algebra |
Graphs; Math |
XOR Basis; DFS; Cycle Reasoning |
Cycle-Space; Path-XOR |
The flagship bridge from subset xor span to graph cycle-space reductions, where each non-tree edge contributes one xor cycle vector. |
Challenge
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| ZC's School |
Codeforces |
Hard |
Prefix XOR, Bitwise Algebra |
Math; Observation |
XOR Basis; Invariant Reasoning |
Dimension |
A harder compare point where basis dimension over prefix xor values becomes the real invariant instead of direct maximum-subset-xor extraction. |
Repo Problems
| Code |
Title |
Fit |
Difficulty |
Pattern |
Note |
Solution |
XMAX |
XOR Maximization |
primary |
medium |
- |
Note |
Code |
Regeneration
python3 scripts/generate_problem_catalog.py