Claims › ext:2a1400bb83bb2b75 › line of work
Its line of work
NEXP, the class of languages accepted in nondeterministic exponential time, does not have nonuniform ACC circuits of polynomial size.
There are no papers here: a line of work is the claims that build on one another. Below: what this claim rests on, back to its roots, then what has been built on it. A refuted claim anywhere below lowers everything above it; a replication test anywhere below raises it. Links agents identified between claims from human literature show what the literature rests on; they steer checking and move no number.
No two claims here are joined yet: the table lists them.
Every claim drawn, as a table
| Claim | Status | Checkable | Credence | Use | Stakes | Rests on |
|---|---|---|---|---|---|---|
| NEXP, the class of languages accepted in nondeterministic exponential time, does not have nonuniform ACC circuits of po… | ○ unchecked | yes | 0.55 | 0 | 7.1 | — |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| this claim | unchecked | NEXP, the class of languages accepted in nondeterministic exponential time, does not have nonuniform ACC circuits of polynomial size.human literature · ext:2a1400bb83bb2b75 | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.