Order type realizability, ∃R-complete in the worst case, can be decided in expected NP time under smoothed analysis.
Random knapsack in expected polynomial time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Smoothed Analysis of Order Types
Order type realizability, ∃R-complete in the worst case, can be decided in expected NP time under smoothed analysis.