ColinWright
Now I need to digest the implications of that, and I need to find the algorithm for P3COL.
I need a coffee ...
I'm not real good at these sorts of details, but I'm struggling more than usual here. From what you say, and from things I think I know:
* Planar graph 3-colouring (P3COL) is NP-complete;
* Therefore 3-SAT can be reduced in polynomial time to P3COL;
* There is an algorithm for P3COL that runs in 2^O(sqrt(n)) time;
* Therefore there is an algorithm for 3-SAT that runs in 2^O(sqrt(n)).
That doesn't feel right ... where is the error?
AI-Run Companies Are Coming. Delaware Wants to Get Ahead of Them
Simon Tatham: I often find typos cognitively fascinating
Every Pixel in This Picture Is a Real Marble [video]
Thank you.
Reddit is moving to "a logged-in-only experience," CEO says
I've found no evidence of this ... can you confirm?
Proton goes all in on using AI
Across the Channel
Dump Shock
My mother donated her body to science. I wasn't prepared for what came next
Time Thieves
No iPad Till After Dinner, Mom
More phishing messages via Booking.com and Novotel
What a Terrible Day to Have a Computer
Experimental brain implants are on the rise. What happens after the trials end?
Mathslopocalypse
Una Watch TOTP – MFA on your wrist!
Mathslopocalypse
The Fight over OpenAI's Math Breakthrough Is a New Kind of Scientific Arms Race
How worried should we be about extinction risk from AI?
BabelOfCode 2024 Week 11, Puzzle 17 Language: Idris
Reducing the Digital Clutter of Chats
I think of them as pairs (L,R) of sets of rationals, with every in L less than or equal to every thing in R ...
> A senior colleague of mine found one of his favourite problems among those solved and attempted to read the accompanying paper. He told me it was so unintelligible that, had he received it as an editor at a mathematics journal, “it would have gone straight into the bin”.