Triple
T5393014
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Håstad’s switching lemma |
E120579
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Furst–Saxe–Sipser lower bounds
Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
|
E518865
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69bd4637b92c8190b815b6443ae4b323 |
elicitation | completed |
| NER | batch_69bd871b81d08190993928e2c6251226 |
ner | completed |
| NED1 | batch_69bf3a9b9ff881908edc10f29f62df1c |
ned_source_triple | completed |
| NED2 | batch_69bf3be530188190bde63a481013d24e |
ned_description | completed |
| NEDg | batch_69bf3b4ab72c81908a4a80681fbd3fba |
nedg | completed |
Created at: March 20, 2026, 2:04 p.m.