Andrey G. Nikiforov

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Dualization is a key discrete enumeration problem. It is not known whether or not this problem is polynomial-time solvable. Asymptotically optimal dualization algorithms are the fastest among the known dualization algorithms, which is supported by new experiments with various data described in this paper. A theoretical justification of the efficiency of(More)
  • 1