blog "Gödel’s Lost Letter and P=NP"
E583431
"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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Gödel’s Lost Letter and P=NP | 1 |
| blog "Gödel’s Lost Letter and P=NP" canonical | 1 |
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
blog
ⓘ
mathematics blog ⓘ theoretical computer science blog ⓘ |
| audience |
computer science enthusiasts
ⓘ
graduate students in computer science ⓘ mathematicians ⓘ researchers in theoretical computer science ⓘ |
| discusses |
NP-completeness
NERFINISHED
ⓘ
circuit complexity ⓘ cryptography-related complexity issues ⓘ derandomization ⓘ historical anecdotes in mathematics ⓘ open problems in complexity theory ⓘ research problems in algorithms ⓘ results in computational complexity ⓘ |
| field |
algorithms
ⓘ
computational complexity theory ⓘ discrete mathematics ⓘ mathematics ⓘ theoretical computer science ⓘ |
| hasAuthor | Richard Lipton NERFINISHED ⓘ |
| hasCategory |
computer science blog
ⓘ
mathematics ⓘ science communication ⓘ theoretical computer science ⓘ |
| hasCoAuthor | Ken Regan NERFINISHED ⓘ |
| hasFormat | online blog ⓘ |
| hasMedium | web ⓘ |
| hasNotability | widely read in the theoretical computer science community ⓘ |
| hasPerspective |
expository
ⓘ
research-oriented ⓘ |
| language | English ⓘ |
| mainTopic |
P versus NP problem
NERFINISHED
ⓘ
algorithm design ⓘ combinatorics ⓘ complexity classes ⓘ computational hardness ⓘ graph theory ⓘ probabilistic methods in algorithms ⓘ |
| namedAfter |
Kurt Gödel
NERFINISHED
ⓘ
P versus NP problem NERFINISHED ⓘ |
| writingStyle |
accessible
ⓘ
conversational ⓘ informal ⓘ |
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
Gödel’s Lost Letter and P=NP