Record · blog.computationalcomplexity.org
Some thoughts on journals, refereeing, and the P vs NP problem
Computational Complexity · 4 August 2025 · 4 min read
A post on blog.computationalcomplexity.org, published 4 August 2025, is cited by 2 distinct blogs to date (corpus.blog, measured 11 October 2026).
A record is what was published and who pointed at it. The text of the post is not shown here: read it at the source, or at its Wayback capture.
2blogs citing
| Period | Blogs | Links |
|---|---|---|
| All time | 2 | 2 |
| Last 90 days | 0 | 0 |
| Last 30 days | 0 | 0 |
| Last 7 days | 0 | 0 |
| First cited | 14 Aug 2025 |
|---|---|
| Latest citation | 1 Sept 2025 |
| Words blogs link it with | 2 |
| External links | 4 |
| Length | 760 |
Words blogs link it with
The words blogs link this page with, by how many different blogs use them.
- computational complexity1 blog
- “sat requires exhaustive search,”1 blog
Cited by 2 blogs in 2 posts
One row per blog, the most recently citing first. Each shows the blog's newest citing post; open a row for the others.
Blog
Newest citing post
Date
flyingcoloursmaths.co.uk1 post
Carnival of Mathematics 242
linked as “Computational Complexity”
Read at flyingcoloursmaths.co.uk (opens in a new tab)1 Sept 2025
Scott Aaronson1 post
Updates!
linked as ““SAT requires exhaustive search,””
Read at scottaaronson.blog (opens in a new tab)14 Aug 2025
Links from this post
Link
Host
people.cs.rutgers.edu
Something wrong here? Report a problem