frontpage.

A short time ago, in the discussion about Integer Linear Programming, I made a comment[0] about the relative hardness of Graph Vertex 3-Colouring (G3C), Satisfiability (SAT), and Integer Factoring (FAC). That got a few upvotes, but almost certainly just because it made clear and explicit the connections, and gathered together the ideas scattered through other replies.

But ... would anyone be interested in seeing a relatively complete proof that G3C is NPC?

https://news.ycombinator.com/item?id=44278725

Cydonis: Core Technology Pitch

Android Rooting Resource

UK woefully unprepared for Chinese and Russian undersea cable sabotage

Show HN: Go Port of OpenAI's Agents SDK

If AI takes all of our jobs who's going to buy everything?

Munich from a Hamburger's Perspective

Radio waves detected beneath Antarctica's ice

Fusion Energy Will Power the AI Boom [video]

Show HN: I wrote a log streaming tool which takes 3 seconds to setup

Archaeologists unearth ancient bread that survived underground for 5k years

Miru (anime player) is no longer open source

Frogger 2's source code was recovered from a DESTROYED tape [video]

Show HN: Zeekstd – Rust Implementation of the ZSTD Seekable Format

Fischer Black, My Economist Father

Show HN: POS also with content management system for product display in website

Adult sport leagues are taking over your city

Meccano Pinball Machine

Reverse Engineering Hanwha Security Camera Firmware File Decryption with Ida Pro

Things that influence my mental state

Show HN: Codehooks MCP-server beta – deploy automations and integrations quickly

Closed-eye pressure and movement monitoring via contact lens

Israel's Next-Gen Combat Vehicles in Gaza

Electromechanical Atari Is a Steampunk Meccano Masterpiece

AI Is a New Computer

Why it's nearly impossible to buy an original Bob Ross painting

Insert Knob A in Hole B

Soon Your Orange Juice Will Have Even Less Real Orange in It

Goose Perception agents watching, listening, learning and acting

Sequence Diagram: Verifying a TLS Certificate with its Issuer

IPOChatter: Track Prospective Tech IPOs

Is there interest in an informal proof that Graph Vertex 3-Colouring is NPC?

Comments