Continuous Defensive δ-Covering is Σ²_P-complete when attacks are restricted to vertices for large δ and NP-complete when attacks can be any points on the graph.
Propositional truth maintenance systems: Classification and complexity analysis.Ann
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Continuous Defensive Domination Problems
Continuous Defensive δ-Covering is Σ²_P-complete when attacks are restricted to vertices for large δ and NP-complete when attacks can be any points on the graph.