Number of the records: 1  

A Lower Bound on CNF Encodings of the At-most-one Constraint

  1. 1.
    0494392 - ÚI 2020 RIV NL eng J - Journal Article
    Kučera, P. - Savický, Petr - Vorel, V.
    A Lower Bound on CNF Encodings of the At-most-one Constraint.
    Theoretical Computer Science. Roč. 762, March (2019), s. 51-73. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GBP202/12/G061
    Grant - others:GA ČR(CZ) GA15-15511S
    Institutional support: RVO:67985807
    Keywords : Knowledge compilation * Cardinality constraint * At most one constraint * Propagation complete encoding
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 0.747, year: 2019
    Method of publishing: Limited access
    http://dx.doi.org/10.1016/j.tcs.2018.09.003

    Permanent Link: http://hdl.handle.net/11104/0287600
    FileDownloadSizeCommentaryVersionAccess
    a0494392.pdf9607.1 KBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.