A Satisfiability-Based Approximate Algorithm for Logic Synthesis Using Switching Lattices.

Levent Aksoy Mustafa Altun

Published in: DATE (2019)

Keyphrases

computational complexity
search space
learning algorithm
dynamic programming
np hard
concept lattice
optimal solution
worst case
optimization algorithm
undirected graph
simulated annealing
random walk