pith. sign in

Title resolution pending

· 1973 · DOI 10.1016/s0022-0000(73)80029-7

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CC 2

years

2026 2

verdicts

UNVERDICTED 2

clear filters

representative citing papers

$O(n +f(k))$: Truly Linear FPT

cs.CC · 2026-06-01 · unverdicted · novelty 6.0

Defines TLFPT as O(n) + f(k) algorithms, proves it is strictly contained in Linear FPT via diagonalization, and exhibits several problems (SAT, Vertex Cover, k-Path, etc.) that belong to TLFPT under parameters such as treedepth and BFS-width.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • $O(n +f(k))$: Truly Linear FPT cs.CC · 2026-06-01 · unverdicted · none · ref 5

    Defines TLFPT as O(n) + f(k) algorithms, proves it is strictly contained in Linear FPT via diagonalization, and exhibits several problems (SAT, Vertex Cover, k-Path, etc.) that belong to TLFPT under parameters such as treedepth and BFS-width.

  • Feasibilism, Explication, and the Cobham-Edmonds Thesis cs.CC · 2026-07-01 · unverdicted · none · ref 94

    Presents analogous arguments supporting the Cobham-Edmonds thesis that feasible computation explicates to P.