Claims › ext:44cf986dbe812592 › line of work
Its line of work
For every choice of positive integers c and k such that k ≥ 3 and c 2 - k ≥ 0.7, there is a positive number ε such that, with probability tending to 1 as n tends to ∞, a randomly chosen family of cn clauses of size k over n variables is unsatisfiable, but every resolution proof of its unsatisfiability must generate at least (1 + ε) n clauses.
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 |
|---|---|---|---|---|---|---|
| For every choice of positive integers c and k such that k ≥ 3 and c 2 - k ≥ 0.7, there is a positive number ε such that… | ○ unchecked | yes | 0.55 | 0 | 8.8 | — |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| this claim | unchecked | For every choice of positive integers c and k such that k ≥ 3 and c 2 - k ≥ 0.7, there is a positive number ε such that, with probability tending to 1 as n ten…human literature · ext:44cf986dbe812592 | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.