NP queries may cost 100x their P counterparts: the complexity catch in simulating harder computations
jessi_cata · x · 2026-09-10
A technical exchange speculating that an NP query might take 100x the time of the corresponding P computation as a plausible constant factor. The counterpoint: any simulation still needs to be poly-time with low constants, which raises the difficulty — though allowed approximations could make it more feasible.
More from Research
- Turing launches CEO Bench: 500+ expert tasks test frontier agents in a simulated company — ecekamar · 2026-09-10
- Academics warn AI lets colleagues turn half-baked ideas into papers, breaking incentives further — erikphoel · 2026-09-10
- SpeechLMs secretly transcribe: implicit text-decodable stage found in middle layers — kastnerkyle · 2026-09-10
- 415k hours of full-duplex dialogue speech dataset released for spoken dialogue model training — kastnerkyle · 2026-09-10
- NAVER AI Lab Revisits Complete Reasoning Traces for Post-Training in New Paper — kastnerkyle · 2026-09-10
- Quantum sensor team uses GPT-5.6 Pro + Codex on Inverse Galois Problem, ranks 14th on IGP24 leaderboard — paulfinneyx · 2026-09-10