Number of the records: 1
Boolean Functions with a Simple Certificate for CNF Complexity.
- 1.0440854 - ÚI 2015 US eng V - Research Report
Čepek, O. - Kučera, P. - Savický, Petr
Boolean Functions with a Simple Certificate for CNF Complexity..
Piscataway: Rutgers Center for Operations Research, 2010. 30 s. Technical Report, RRR 2-2010.
R&D Projects: GA MŠMT(CZ) 1M0545
Grant - others:GA ČR GP201/07/P168; GA ČR GA201/07/0205
Institutional research plan: CEZ:AV0Z10300504
Keywords : Boolean functions * CNF representations
Subject RIV: BA - General Mathematics
Cited: 1
--- HELLERSTEIN, L. - KLETENIK, D. On the gap between ess(f) and cnf_size(f). DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X, JAN 2013, vol. 161, no. 1-2, p. 19-27. [WOS]
Permanent Link: http://hdl.handle.net/11104/0243946File Download Size Commentary Version Access 02_2010.pdf 0 873 KB Other open-access
Number of the records: 1