Počet záznamů: 1
A Lower Bound on CNF Encodings of the At-Most-One Constraint
- 1.Kučera, P. - Savický, Petr - Vorel, V.
A Lower Bound on CNF Encodings of the At-Most-One Constraint.
Theory and Applications of Satisfiability Testing - SAT 2017. Cham: Springer, 2017 - (Gaspers, S.; Walsh, T.), s. 412-428. Lecture Notes in Computer Science, 10491. ISBN 978-3-319-66262-6. ISSN 0302-9743.
[SAT 2017. International Conference on Theory and Applications of Satisfiability Testing /20./. Melbourne (AU), 28.08.2017-01.09.2017]
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://hdl.handle.net/11104/0274603
Citováno: 1
--- EHLERS, R. - ROMERO, F.P. Approximately Propagation Complete and Conflict Propagating Constraint Encodings. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2018. ISSN 0302-9743, 2018, vol. 10929, p. 19-36. [WOS]
Počet záznamů: 1