Number of the records: 1  

Boolean Functions with a Simple Certificate for CNF Complexity.

    1.
    SYSNO ASEP0440854
    Document TypeV - Research Report
    R&D Document TypeThe record was not marked in the RIV
    TitleBoolean Functions with a Simple Certificate for CNF Complexity.
    Author(s) Čepek, O. (CZ)
    Kučera, P. (CZ)
    Savický, Petr (UIVT-O) SAI, RID, ORCID
    Issue dataPiscataway: Rutgers Center for Operations Research, 2010
    SeriesTechnical Report
    Series numberRRR 2-2010
    Number of pages30 s.
    Languageeng - English
    CountryUS - United States
    KeywordsBoolean functions ; CNF representations
    Subject RIVBA - General Mathematics
    R&D Projects1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2015
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.

Accept allSettingsReject all