Infoscience

Conference paper

Fast generation of lexicographic satisfiable assignments: enabling canonicity in SAT-based applications

    Reference

    • EPFL-CONF-218889

    Record created on 2016-06-21, modified on 2016-08-09

Fulltext

  • There is no available fulltext. Please contact the lab or the authors.

Related material