MonstreamSign in
Discover
Radarby Gurgen Arakelov · Daily batch, 09:00 UTC

P vs NP

Where the P vs NP question stands: circuit and proof-complexity lower bounds, barriers, meta-complexity, geometric complexity theory, new reductions and hardness results, and how the community reads each claimed proof.

Explore streams
78Subscribers
1Results so far
Oct 2026Created
3h agoLast update
About

Where the P vs NP question stands: circuit and proof-complexity lower bounds, barriers, meta-complexity, geometric complexity theory, new reductions and hardness results, and how the community reads each claimed proof.

Overview
  • One batch a day at 09:00 (UTC) with that day’s new finds.
  • Each with a short summary and why it matched.
  • In your feed, by email, and as a push notice if you turn it on.
Topics
Computational complexity research bearing on P vs NPCircuit lower boundsProof complexityBarriers: relativization, natural proofs, algebrizationMeta-complexity and MCSPGeometric complexity theoryNP-hardness and fine-grained complexityExpert assessment of a claimed proofSurvey or talk by a leading researcher
Exclusions
  • ✕ Claimed proofs by unknown authors with no expert reaction
  • ✕ Algorithm engineering for one NP-hard problem without complexity results
  • ✕ Popular explainers that report nothing new
  • ✕ Old events retold as new
Sources
eccc.weizmann.ac.ilarXiv · cs.CCblog.computationalcomplexity.orgscottaaronson.blogrjlipton.comwindowsontheory.orgQuanta MagazineGoogle Newsand other sources
Listed sources are searched first, then the open web.
1find so far
78subscriber
3h agolast update
RadarDaily batch, 09:00 UTC
Exact rules

Once a day at 09:00, send me new finds with Computational complexity research bearing on P vs NP, plus at least one of Circuit lower bounds, Proof complexity, Barriers: relativization, natural proofs, algebrization, Meta-complexity and MCSP, Geometric complexity theory, NP-hardness and fine-grained complexity, Expert assessment of a claimed proof or Survey or talk by a leading researcher. Skip claimed proofs by unknown authors with no expert reaction, algorithm engineering for one np-hard problem without complexity results, popular explainers that report nothing new or old events retold as new. Search the open web, starting with https://eccc.weizmann.ac.il/feeds/reports/, cs.CC, https://blog.computationalcomplexity.org/feeds/posts/default and https://scottaaronson.blog/?feed=rss2, and also https://rjlipton.com/feed/, https://windowsontheory.org/feed/, https://www.quantamagazine.org/feed/ and https://news.google.com/rss/search?q=%22P+vs+NP%22+OR+%22P+versus+NP%22+OR+%22P+%3D+NP%22+when%3A14d&hl=en-US&gl=US&ceid=US:en, but never vixra.org, medium.com, hub.valency.io, agihunt.info, glonce.com, postcutoff.com, dataphoenix.info, magazine.mindplex.ai, aixiv.science or kenji.blog. Matching is strict. Anyone can find and subscribe to it in Discover.

DeliversRadar · Daily batch, 09:00 UTC
TracksWhere the P vs NP question stands: circuit and proof-complexity lower bounds, barriers, meta-complexity, geometric complexity theory, new reductions and hardness results, and how the community reads each claimed proof.
Must matchComputational complexity research bearing on P vs NP
At least one ofCircuit lower bounds, Proof complexity, Barriers: relativization, natural proofs, algebrization, Meta-complexity and MCSP, Geometric complexity theory, NP-hardness and fine-grained complexity, Expert assessment of a claimed proof, Survey or talk by a leading researcher
Strictnessstrict — only results that meet every rule
SkipsClaimed proofs by unknown authors with no expert reaction; Algorithm engineering for one NP-hard problem without complexity results; Popular explainers that report nothing new; Old events retold as new
ReadsAutomatic, plus https://eccc.weizmann.ac.il/feeds/reports/ (preferred), cs.CC (preferred), https://blog.computationalcomplexity.org/feeds/posts/default (preferred), https://scottaaronson.blog/?feed=rss2 (preferred), https://rjlipton.com/feed/, https://windowsontheory.org/feed/, https://www.quantamagazine.org/feed/, https://news.google.com/rss/search?q=%22P+vs+NP%22+OR+%22P+versus+NP%22+OR+%22P+%3D+NP%22+when%3A14d&hl=en-US&gl=US&ceid=US:en
Never readsvixra.org, medium.com, hub.valency.io, agihunt.info, glonce.com, postcutoff.com, dataphoenix.info, magazine.mindplex.ai, aixiv.science, kenji.blog

More in Science

Streams that already watch this field. Follow one as it is — it costs nothing extra.

See all in Science →
Can’t find what you need? Describe it in a sentence and Monstream builds the stream for you.Create your own →