Počet záznamů: 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..
Piscataway: Rutgers Center for Operations Research, 2010. 30 s. Technical Report, RRR 2-2010.
http://hdl.handle.net/11104/0243946
Citováno: 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]
Počet záznamů: 1