Covering points by boundaries of axis-parallel rectangles is NP-complete in the free-placement setting, W[1]-hard when rectangles are preset, and fixed-parameter tractable in the solution size k.
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis , booktitle =
4 Pith papers cite this work, alongside 7 external citations. Polarity classification is still indexing.
4
Pith papers citing it
7
external citations · external index
years
2026 4representative citing papers
Introduces the 'innovation' property of LLMs and proves it is an almost characterization of hallucination while deriving new lower bounds on hallucination rates via missing mass.
PUMA detects reasoning-level semantic redundancy to enable early exit in chains of thought, achieving 26.2% average token reduction across five LRMs and five benchmarks while preserving accuracy and CoT quality.
citing papers explorer
-
Covering Points with Rectangular Boundaries
Covering points by boundaries of axis-parallel rectangles is NP-complete in the free-placement setting, W[1]-hard when rectangles are preset, and fixed-parameter tractable in the solution size k.
-
Innovation: An Almost Characterization of Hallucination
Introduces the 'innovation' property of LLMs and proves it is an almost characterization of hallucination while deriving new lower bounds on hallucination rates via missing mass.
-
Stop When Reasoning Converges: Semantic-Preserving Early Exit for Reasoning Models
PUMA detects reasoning-level semantic redundancy to enable early exit in chains of thought, achieving 26.2% average token reduction across five LRMs and five benchmarks while preserving accuracy and CoT quality.
- Fine-grained Claim-level RAG Benchmark for Law