Monotonic reductions, representative equivalence, and compilation of intractable problems
From MaRDI portal
Publication:3196627
DOI10.1145/504794.504795zbMath1323.68305OpenAlexW1972826134MaRDI QIDQ3196627
Publication date: 30 October 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/504794.504795
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
On the complexity of second-best abductive explanations ⋮ On the complexity of case-based planning ⋮ Compiling propositional weighted bases
This page was built for publication: Monotonic reductions, representative equivalence, and compilation of intractable problems
