Computationally related problems.¶
Sahni, S. (1974). Computationally related problems. SIAM Journal on Computing, 3(4), 262-279.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Branch and Bound
- In computational complexity, branch-and-bound is a case study in how typical-case performance can diverge dramatically from worst-case complexity (cf. Sahni 1974
This sourcestudy of complexity-class structure among combinatorial-optimization problems, relevant to the worst-case-vs-typical-case behavior of branch-and-bound on NP-hard instances.
- In computational complexity, branch-and-bound is a case study in how typical-case performance can diverge dramatically from worst-case complexity (cf. Sahni 1974
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:732bd6b2ade9 · see in the full table