pith. machine review for the scientific record. sign in

Title resolution pending

Rajeev Motwani, Arvind Raghunathan, Huzur Saran , title = · 1990 · DOI 10.1016/0022-0000(90)90017-f

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 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.CG 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Witness Set: A Visibility Problem in $NP\cap XP$

cs.CG · 2026-05-02 · unverdicted · novelty 7.0

Witness Set for simple polygons is in NP ∩ XP and admits an n^{f(k)}-time algorithm via combinatorial discretization, in contrast to its ∃R-complete dual.

citing papers explorer

Showing 1 of 1 citing paper.

  • Witness Set: A Visibility Problem in $NP\cap XP$ cs.CG · 2026-05-02 · unverdicted · none · ref 54

    Witness Set for simple polygons is in NP ∩ XP and admits an n^{f(k)}-time algorithm via combinatorial discretization, in contrast to its ∃R-complete dual.