Login / Signup
NP-completeness of the alphabetical satisfiability problem for trace equations.
Luca Breveglieri
Alessandra Cherubini
Claudia Di Nucci
Emanuele Rodaro
Published in:
AFL (2008)
Keyphrases
</>
satisfiability problem
np complete
search algorithm
temporal logic
phase transition
sat problem
sat instances
pspace complete
solving hard
stochastic local search algorithms
stochastic local search
max sat
decision procedures
reinforcement learning
computational complexity
np hard