Login / Signup
On the complexity of CSP-based ideal membership problems.
Andrei A. Bulatov
Akbar Rafiey
Published in:
STOC (2022)
Keyphrases
</>
problems involving
decision problems
information systems
np complete
constraint satisfaction problems
solving problems
np hardness
real time
data sets
computational complexity
np hard
combinatorial optimization
decomposition methods
tractable cases