SAT Solvers and their Limits with NFSR-based Stream Ciphers: an Example with Grain v1.
Andreas SchaffhauserPublished in: CECC (2019)
Keyphrases
- sat solvers
- orders of magnitude
- propositional satisfiability
- constraint satisfaction
- sat solving
- sat problem
- boolean satisfiability
- search tree
- search strategies
- search space
- max sat
- sat instances
- clause learning sat solvers
- clause learning
- constraint satisfaction problems
- dynamic programming
- sat encodings
- information retrieval
- weighted max sat