Number of the records: 1
Boolean Functions with a Simple Certificate for CNF Complexity
- 1.0351382 - ÚI 2013 RIV NL eng J - Journal Article
Č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
R&D Projects: GA MŠMT(CZ) 1M0545
Grant - others:GA ČR(CZ) GP201/07/P168; GA ČR(CZ) GAP202/10/1188
Institutional research plan: CEZ:AV0Z10300504
Keywords : Boolean functions * CNF representations
Subject RIV: BA - General Mathematics
Impact factor: 0.718, year: 2012
Permanent Link: http://hdl.handle.net/11104/0191148
Number of the records: 1