Solution independence distinguishes hypergraph dominating set from vertex cover, enabling irreducible self-referential instances that force algorithms to examine nearly the full input.
Title resolution pending
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
-
Solution independence and self-referential instances
Solution independence distinguishes hypergraph dominating set from vertex cover, enabling irreducible self-referential instances that force algorithms to examine nearly the full input.