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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A replica exchange MCMC algorithm couples constrained and relaxed chains to sample from disconnected implicit manifolds defined by nonlinear constraints.
citing papers explorer
-
Witness Set: A Visibility Problem in $NP\cap XP$
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.
-
A Replica Exchange Markov Chain Monte Carlo Method for Disconnected Implicit Manifolds via Tubular Relaxation
A replica exchange MCMC algorithm couples constrained and relaxed chains to sample from disconnected implicit manifolds defined by nonlinear constraints.