Set-Cover Heuristics for Two-Level Logic Minimization.

Ankit Kagliwal Shankar Balachandran

Published in: VLSI Design (2012)

Keyphrases

set cover
greedy heuristics
greedy heuristic
greedy algorithm
approximation algorithms
np hard
network flow
solution space
scheduling problem
objective function
convex hull
modal logic
worst case
lower bound
logic programming
np complete
multi dimensional
multi objective
special case
training data