Triple
T6417197
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Omer Reingold |
E127857
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Undirected connectivity in log-space
"Undirected connectivity in log-space" is a landmark theoretical computer science paper by Omer Reingold that proved the complexity classes L and SL are equal by giving a deterministic log-space algorithm for undirected graph connectivity.
|
E591745
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c0083815208190a9b299b8e0640218 |
elicitation | completed |
| NER | batch_69c068ea06b08190901e0c0a18fd5170 |
ner | completed |
| NED1 | batch_69c640ce3f9481908fa96fb5b2bc8db9 |
ned_source_triple | completed |
| NED2 | batch_69c641b5ac988190bde502b6637736fe |
ned_description | completed |
| NEDg | batch_69c6415095488190ae506fb8ec95d4c6 |
nedg | completed |
Created at: March 22, 2026, 4:42 p.m.