polynomial-time

Tag

Cards List
#polynomial-time

Semiclassical Gravity Efficiently Solves NP-Complete Problems

Hacker News Top · 2026-06-17 Cached

This paper argues that under semiclassical gravity, a massive qubit can solve NP-complete problems in polynomial time via nonlinear dynamics, implying gravity must be quantized.

0 favorites 0 likes
← Back to home

Submit Feedback