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. Roč. 160, 4-5 (2012), s. 365-382. ISSN 0166-218X. E-ISSN 1872-6771
Impact factor: 0.718, year: 2012
http://hdl.handle.net/11104/0191148
Number of the records: 1