Triple
T1043666
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Johan Håstad |
E22525
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
“Almost optimal lower bounds for small depth circuits”
“Almost optimal lower bounds for small depth circuits” is a seminal theoretical computer science paper by Johan Håstad that establishes near-tight lower bounds on the size of constant-depth Boolean circuits, profoundly influencing circuit complexity theory.
|
E120580
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a493d91478819094cc01fb65564bc1 |
elicitation | completed |
| NER | batch_69a4b8475ab48190848388eea6448cb6 |
ner | completed |
| NED1 | batch_69ac3bc97dec81909b6ad48e3f203923 |
ned_source_triple | completed |
| NED2 | batch_69ac3cbd43848190854add440753fdad |
ned_description | completed |
| NEDg | batch_69ac3c42c2c081909ccadbf944d3aa6c |
nedg | completed |
Created at: March 1, 2026, 7:42 p.m.