A crossbred algorithm for solving Boolean polynomial systems.
Antoine JouxVanessa VitsePublished in: IACR Cryptol. ePrint Arch. (2017)
Keyphrases
- detection algorithm
- cost function
- optimal solution
- dynamic programming
- learning algorithm
- improved algorithm
- search space
- experimental evaluation
- probabilistic model
- times faster
- optimization algorithm
- similarity measure
- preprocessing
- objective function
- expectation maximization
- matching algorithm
- segmentation algorithm
- polynomially bounded
- np hard
- quadratic programming
- recognition algorithm
- k means
- computationally efficient
- particle swarm optimization
- distributed systems
- data sets
- computational cost
- significant improvement