Number of the records: 1
Boolean Functions with a Simple Certificate for CNF Complexity
- 1.ČEPEK, O., KUČERA, P., SAVICKÝ, Petr. Boolean Functions with a Simple Certificate for CNF Complexity. Discrete Applied Mathematics. 2012, 160(4-5), 365-382. ISSN 0166-218X. E-ISSN 1872-6771. Available: doi: 10.1016/j.dam.2011.05.013
Number of the records: 1