Computational Complexity blog
E735009
The Computational Complexity blog is a long-running, influential blog on theoretical computer science and complexity theory, co-authored by Lance Fortnow (and often Bill Gasarch), featuring commentary on research, academia, and the theory community.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Computational Complexity blog canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T8449039 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Computational Complexity blog Context triple: [Lance Fortnow, hasBlog, Computational Complexity blog]
-
A.
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
-
B.
Complexity Theory
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
-
C.
blog "Gödel’s Lost Letter and P=NP"
"Gödel’s Lost Letter and P=NP" is a widely read theoretical computer science and mathematics blog, co-authored by Richard Lipton, that explores complexity theory, algorithms, and related topics in an accessible, conversational style.
-
D.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
E.
Papadimitriou: Computational Complexity
"Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Computational Complexity blog Target entity description: The Computational Complexity blog is a long-running, influential blog on theoretical computer science and complexity theory, co-authored by Lance Fortnow (and often Bill Gasarch), featuring commentary on research, academia, and the theory community.
-
A.
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
-
B.
Complexity Theory
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
-
C.
blog "Gödel’s Lost Letter and P=NP"
"Gödel’s Lost Letter and P=NP" is a widely read theoretical computer science and mathematics blog, co-authored by Richard Lipton, that explores complexity theory, algorithms, and related topics in an accessible, conversational style.
-
D.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
E.
Papadimitriou: Computational Complexity
"Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
- F. None of above. chosen
Statements (32)
| Predicate | Object |
|---|---|
| instanceOf |
blog
ⓘ
theoretical computer science blog ⓘ |
| about |
complexity theory community
ⓘ
theoretical computer science community ⓘ |
| author |
Bill Gasarch
NERFINISHED
ⓘ
Lance Fortnow NERFINISHED ⓘ |
| coAuthor |
Bill Gasarch
NERFINISHED
ⓘ
Lance Fortnow NERFINISHED ⓘ |
| creator | Lance Fortnow NERFINISHED ⓘ |
| field |
computational complexity theory
ⓘ
computer science ⓘ theoretical computer science ⓘ |
| focus |
commentary on academia
ⓘ
commentary on research ⓘ commentary on theory community ⓘ |
| genre |
academic blog
ⓘ
science blog ⓘ |
| hasContributor | guest bloggers ⓘ |
| hasFormat | online blog posts ⓘ |
| influential | true ⓘ |
| language | English ⓘ |
| longRunning | true ⓘ |
| medium | web ⓘ |
| notableFor |
discussion of academic culture in theoretical computer science
ⓘ
discussion of complexity theory results ⓘ |
| topic |
P versus NP problem
NERFINISHED
ⓘ
academic life ⓘ computational complexity ⓘ conferences in theoretical computer science ⓘ open problems in complexity theory ⓘ research in theoretical computer science ⓘ theory community ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Computational Complexity blog Description of subject: The Computational Complexity blog is a long-running, influential blog on theoretical computer science and complexity theory, co-authored by Lance Fortnow (and often Bill Gasarch), featuring commentary on research, academia, and the theory community.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.