Claims › ext:9bb2898c329a039b › line of work
Its line of work
We present a polynomial time algorithm that finds a satisfying assignment of F with high probability for constraint densities m/n<(1-eps_k)2^k\ln(k)/k, where eps_k->0.
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 |
|---|---|---|---|---|---|---|
| We present a polynomial time algorithm that finds a satisfying assignment of F with high probability for constraint den… | ○ unchecked | yes | 0.55 | 0 | 6.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 | We present a polynomial time algorithm that finds a satisfying assignment of F with high probability for constraint densities m/n<(1-eps_k)2^k\ln(k)/k, where e…human literature · ext:9bb2898c329a039b | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.