Complexity of minimum-size arc-inconsistency explanations
From MaRDI portal
Publication:6154178
DOI10.1007/S10601-023-09360-5MaRDI QIDQ6154178FDOQ6154178
Authors: Christian Bessiere, Clément Carbonnel, M. C. Cooper, Emmanuel Hebrard 
Publication date: 14 February 2024
Published in: Constraints (Search for Journal in Brave)
Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Handbook of constraint programming.
- Parametrized complexity theory.
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- On Parameterized Approximability
- Completely inapproximable monotone and antimonotone parameterized problems
- A framework for step-wise explaining how to solve constraint satisfaction problems
- A birthday repetition theorem and complexity of approximating dense CSPs
- From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
This page was built for publication: Complexity of minimum-size arc-inconsistency explanations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154178)
