POPA ReconThis is a spectacular result, saying the NP complete problem over n variables can be solved in much less than 2^n time.
Source reports
- This is a spectacular result, saying the NP complete problem over n variables can be solved in much less than 2^n time. I love it, always thought that SAT shouldn’t be as hard as 2^n. It doesn’t mean P=NP, though. — @EliBenSasson (X), Oct 26, 2026, 22:24 UTC
Excerpts are quoted from the linked sources, which own their text.