Number of the records: 1  

A note on propositional proof complexity of some Ramsey-type statements

  1. 1.
    SYSNO0369652
    TitleA note on propositional proof complexity of some Ramsey-type statements
    Author(s) Krajíček, Jan (MU-W) SAI, ORCID
    Source Title Archive for Mathematical Logic. Roč. 50, 1-2 (2011), s. 245-255. - : Springer
    Document TypeČlánek v odborném periodiku
    Grant IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    LC505 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryDE
    Keywords proof complexity * Ramsey theorem * resolution
    URLhttp://www.springerlink.com/content/q27255801x225772/
    Permanent Linkhttp://hdl.handle.net/11104/0203666
    FileDownloadSizeCommentaryVersionAccess
    Krajicek.pdf2188.1 KBPublisher’s postprintrequire
     
Number of the records: 1  

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