Login / Signup
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems.
Shuichi Hirahara
Naoto Ohsaka
Published in:
STOC (2024)
Keyphrases
</>
database
decision making
np complete
problems involving
databases
information systems
application domains
manufacturing systems
difficult problems
genetic algorithm
computer vision
objective function
hidden markov models
decision problems