Triple
T23341540
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Undirected connectivity in log-space |
E591745
|
entity |
| Predicate | proves |
P21917
|
FINISHED |
| Object | every undirected graph connectivity instance can be solved in O(log n) space deterministically |
—
|
LITERAL FINISHED |
Provenance (2 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69e25d20e3d08190bcede87673cafb25 |
elicitation | completed |
| NER | batch_69f198334dec819081c432b434eb3ba5 |
ner | completed |
Created at: April 17, 2026, 5:18 p.m.