Researcher claims new ~2^(n/√(log n)) 3SAT approach, drafted via AI chat until hitting max-length
brandondamos · x · 2026-10-29
Reposting @BooleanAnalysis: the author says they've been developing a new idea for #3SAT (sparse permanent) running in 2^(n/√(log n)) time, drafted through an AI chat session until hitting the platform's max conversation length. The write-up spans 20 pages: a 5-page overview, 10 pages of main material, and a 5-page bonus appendix. The author admits it's still badly written but is happy with the progression of ideas.
More from Fun
- User fails AI-generated CAPTCHA despite actually picking the microwave — daluoseo · 2026-10-29
- ChatGPT-made tier list ranks Grok Bot S-tier and puts ChatGPT itself in D — koltregaskes · 2026-10-29
- React hooks called a mistake, yet downloads soar toward 2.4B a year — cnakazawa · 2026-10-29
- Famous X accounts may be posting via AI agents, founder observes — bindureddy · 2026-10-29
- Joke theories abound for Google's Carbon/Argon model naming — michael_galkin · 2026-10-29
- Will Smith eating spaghetti: the AI video meme that won't die — Busy_Connection_8027 · 2026-10-29